{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OPUELBXNSYLREF2DFIL3CLDPRI","short_pith_number":"pith:OPUELBXN","schema_version":"1.0","canonical_sha256":"73e84586ed96171217432a17b12c6f8a05b63747d9f4506c41b2378c9dfdf226","source":{"kind":"arxiv","id":"1705.09808","version":1},"attestation_state":"computed","paper":{"title":"KlusTree: Clustering Answer Trees from Keyword Search on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Madhulika Mohanty, Maya Ramanath","submitted_at":"2017-05-27T11:24:53Z","abstract_excerpt":"Graph structured data on the web is now massive as well as diverse, ranging from social networks, web graphs to knowledge-bases. Effectively querying this graph structured data is non-trivial and has led to research in a variety of directions -- structured queries, keyword and natural language queries, automatic translation of these queries to structured queries, etc. We are concerned with a class of queries called relationship queries, which are usually expressed as a set of keywords (each keyword denoting a named entity). The results returned are a set of ranked trees, each of which denotes "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.09808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-05-27T11:24:53Z","cross_cats_sorted":[],"title_canon_sha256":"16e3161144be7c7c13a3b150bbf2444adbfcea09539b7d5919d4f715f5daae6c","abstract_canon_sha256":"5b0e36fc6645843972a648183f251f7bd7b71956fdfc7766287e424bca259059"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:34.432481Z","signature_b64":"CGxknuIF93ADEv0Km/1ZQPxLviJ8f6HNIjNjAFlNIRHDU9s8E/xiC2QZC97j45Dk4ATQtk6ag1ER0aQMOZxUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73e84586ed96171217432a17b12c6f8a05b63747d9f4506c41b2378c9dfdf226","last_reissued_at":"2026-05-18T00:43:34.432047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:34.432047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KlusTree: Clustering Answer Trees from Keyword Search on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Madhulika Mohanty, Maya Ramanath","submitted_at":"2017-05-27T11:24:53Z","abstract_excerpt":"Graph structured data on the web is now massive as well as diverse, ranging from social networks, web graphs to knowledge-bases. Effectively querying this graph structured data is non-trivial and has led to research in a variety of directions -- structured queries, keyword and natural language queries, automatic translation of these queries to structured queries, etc. We are concerned with a class of queries called relationship queries, which are usually expressed as a set of keywords (each keyword denoting a named entity). The results returned are a set of ranked trees, each of which denotes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09808","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.09808","created_at":"2026-05-18T00:43:34.432110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09808v1","created_at":"2026-05-18T00:43:34.432110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09808","created_at":"2026-05-18T00:43:34.432110+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPUELBXNSYLR","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPUELBXNSYLREF2D","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPUELBXN","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OPUELBXNSYLREF2DFIL3CLDPRI","json":"https://pith.science/pith/OPUELBXNSYLREF2DFIL3CLDPRI.json","graph_json":"https://pith.science/api/pith-number/OPUELBXNSYLREF2DFIL3CLDPRI/graph.json","events_json":"https://pith.science/api/pith-number/OPUELBXNSYLREF2DFIL3CLDPRI/events.json","paper":"https://pith.science/paper/OPUELBXN"},"agent_actions":{"view_html":"https://pith.science/pith/OPUELBXNSYLREF2DFIL3CLDPRI","download_json":"https://pith.science/pith/OPUELBXNSYLREF2DFIL3CLDPRI.json","view_paper":"https://pith.science/paper/OPUELBXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09808&json=true","fetch_graph":"https://pith.science/api/pith-number/OPUELBXNSYLREF2DFIL3CLDPRI/graph.json","fetch_events":"https://pith.science/api/pith-number/OPUELBXNSYLREF2DFIL3CLDPRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPUELBXNSYLREF2DFIL3CLDPRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPUELBXNSYLREF2DFIL3CLDPRI/action/storage_attestation","attest_author":"https://pith.science/pith/OPUELBXNSYLREF2DFIL3CLDPRI/action/author_attestation","sign_citation":"https://pith.science/pith/OPUELBXNSYLREF2DFIL3CLDPRI/action/citation_signature","submit_replication":"https://pith.science/pith/OPUELBXNSYLREF2DFIL3CLDPRI/action/replication_record"}},"created_at":"2026-05-18T00:43:34.432110+00:00","updated_at":"2026-05-18T00:43:34.432110+00:00"}