Re: Web search and Distributed Knowledge Structures

Stan, thanks for joining and sharing

Distributed K is indeed a large topic of interest and what SW research has
been about in the last twenty years afaik

By reading your description I cannot tell exactly how your system solves
what problem, but I may lack some expertise specific to your domain and
limited time to read

It looks to me that what you describe is not sufficiently defined, with
some unclear parts
Regrettably, I do not have time to look into it to find out (but maybe some
others will)

Some general comments

1. if your proposed approach has relevance and novelty for research, have
you submitted the paper to conferences and journals - true, some
submissions are too big a waste of time, but some reviewers give useful
feedback without stealing your work.  Reviewers read your work in detail
and give detailed feedback
eventually this may lead to some publication. it is difficult to find
journals that can provide intelligent reviews though, but it is easy to try
(to upload your paper to conferences and journals)

2. assuming you are not interested in scholarly publications, you should be
able to show a demo
clearly indicating what your demo does that google doesnt. I suspect that
google is on top of the search challenge, and handles distributed search
somewhat. what does your system do that people can find useful and that
google does not do?  you can always run your searh engine on the results
returned by a refined google search

3. there must be a way to get google take a look at this and give feedback?

4.  a colleague suggests patenting this kind of thing to get detailed
feedback from the patent office, if nobody else understand what you are
doing and why


Finally it could be useful if you use some links in your post, to the
resources you point to
It's very difficult to get people to read anything these days,
but some may click links, look at pictures and play with demos for a moment

I cannot possibly read everything that comes my way and suspect others also
Look forward how you plan to address the open challenges in KR

On Sat, Nov 12, 2022 at 12:01 PM Stanislav Srednyak, Ph.D. <
stanislav.srednyak@duke.edu> wrote:

> Dear colleagues,
>
> I would like to inform AIKR WG on the work that we have been doing at
> rorur.com, a decentralized search engine.
>
> The benefits of creating such a search engine hardly need discussion
> within this group. I believe all of you understand the necessity of
> computational experimentation with web scale data. Unfortunately, there is
> no way for the broad research community to participate in the analysis and
> modeling of the data harvested by commercial search engines, such as
> Google. Their code is a closed source, there are no benchmarks, there is
> very little information on the algorithms they are using. The search as
> they provide is commerce centered, rather than knowledge centered.
>
>
> There is a project that aims to collect web data for public good - Common
> Crawl. Unfortunately , there are some structural problems with it. First,
> it it does not collect most of the data, but rather a sample of the web.
> Second, by the nature of the experiments that one may do on the web data,
> they are rather expensive, and there is no way to fund high quality
> research based on community needs.
>
> We addressed these problems using new incentive structures that emerged
> out of blockchain technology, see our whitepaper..
>
> The reason for this letter is the following. We are at the stage when we
> can start collecting data on the web scale. Now the computation on this
> data may become available in the near future. Therefore, we would like the
> community to answer the following question:
>
> Given web data, what kind of distributed computations would be of interest?
>
>
> Let me propose some examples of data structures that we may wish to
> construct in an automated way as a result of such computation.
>
> - distributed knowledge graph. This data structure contains information on
> the distribution of entities among urls, relative position in the web
> graph, context analysis based on proximity , etc
>
> - distributed ranking system. This is a system which assigns to each page
> a "ranking structure" : a function that maps a query string to a real
> number , which computes the relevance of the page for this query.
>
> - distributed ASTs. As an example , consider an area of mathematics, e.g.,
> homotopy theory. As a data structure, it exists in a form of multiple
> semantically connected papers and ursl. Distributed AST organizes this data
> structure into a set of interconnected statements , theorems and HOL
> relations between them ( in the sense of temporal logic).
>
>
> Please give your example here, and don't hesitate to contact me if you
> have any questions. We have a rather precise definition of "distributed
> computation" that stems from the limitations of our system, please consult
> the website.
>
>
> Stan Srednyak
>
>
>