{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5QDMP3DTO66MBVGL2AQ5BKDWBT","short_pith_number":"pith:5QDMP3DT","schema_version":"1.0","canonical_sha256":"ec06c7ec7377bcc0d4cbd021d0a8760ce7339e2d31f285d060fc11b493b3bb3d","source":{"kind":"arxiv","id":"1905.05384","version":1},"attestation_state":"computed","paper":{"title":"Query Processing on Large Graphs: Approaches To Scalability and Response Time Trade Offs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Abhishek Santra, Jay Bodra, Sharma Chakravarthy, Soumyava Das","submitted_at":"2019-05-14T04:17:46Z","abstract_excerpt":"With the advent of social networks and the web, the graph sizes have grown too large to fit in main memory precipitating the need for alternative approaches for an efficient, scalable evaluation of queries on graphs of any size.\n  Here, we use the divide and conquer approach by partitioning a graph and process queries over partitions to obtain all or specified number of answers. This entails correctly computing answers that span multiple partitions or even need the same partition more than once. Given a set of partitions, there are many approaches to evaluate a query: i) One Partition At a Tim"},"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":"1905.05384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-14T04:17:46Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"643a055ee8dede863242a1912d5968fa5ce947636d799dd262bcddb3a54f20c1","abstract_canon_sha256":"0d424f661fa31aa96fe581cdeaca2328c959d76b707769af09caa672f55c0993"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:16.653782Z","signature_b64":"8hlVr4YedUHWUZBPNh7x0vBX2/jJbj1BcT29Spnbmb+HtV5VR5DT1Kw1HU0rg5cZw4pwsA54MpO0GyTw8QRnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec06c7ec7377bcc0d4cbd021d0a8760ce7339e2d31f285d060fc11b493b3bb3d","last_reissued_at":"2026-05-17T23:46:16.653197Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:16.653197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Query Processing on Large Graphs: Approaches To Scalability and Response Time Trade Offs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Abhishek Santra, Jay Bodra, Sharma Chakravarthy, Soumyava Das","submitted_at":"2019-05-14T04:17:46Z","abstract_excerpt":"With the advent of social networks and the web, the graph sizes have grown too large to fit in main memory precipitating the need for alternative approaches for an efficient, scalable evaluation of queries on graphs of any size.\n  Here, we use the divide and conquer approach by partitioning a graph and process queries over partitions to obtain all or specified number of answers. This entails correctly computing answers that span multiple partitions or even need the same partition more than once. Given a set of partitions, there are many approaches to evaluate a query: i) One Partition At a Tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05384","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":"1905.05384","created_at":"2026-05-17T23:46:16.653286+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.05384v1","created_at":"2026-05-17T23:46:16.653286+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05384","created_at":"2026-05-17T23:46:16.653286+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QDMP3DTO66M","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QDMP3DTO66MBVGL","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QDMP3DT","created_at":"2026-05-18T12:33:10.108867+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/5QDMP3DTO66MBVGL2AQ5BKDWBT","json":"https://pith.science/pith/5QDMP3DTO66MBVGL2AQ5BKDWBT.json","graph_json":"https://pith.science/api/pith-number/5QDMP3DTO66MBVGL2AQ5BKDWBT/graph.json","events_json":"https://pith.science/api/pith-number/5QDMP3DTO66MBVGL2AQ5BKDWBT/events.json","paper":"https://pith.science/paper/5QDMP3DT"},"agent_actions":{"view_html":"https://pith.science/pith/5QDMP3DTO66MBVGL2AQ5BKDWBT","download_json":"https://pith.science/pith/5QDMP3DTO66MBVGL2AQ5BKDWBT.json","view_paper":"https://pith.science/paper/5QDMP3DT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.05384&json=true","fetch_graph":"https://pith.science/api/pith-number/5QDMP3DTO66MBVGL2AQ5BKDWBT/graph.json","fetch_events":"https://pith.science/api/pith-number/5QDMP3DTO66MBVGL2AQ5BKDWBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QDMP3DTO66MBVGL2AQ5BKDWBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QDMP3DTO66MBVGL2AQ5BKDWBT/action/storage_attestation","attest_author":"https://pith.science/pith/5QDMP3DTO66MBVGL2AQ5BKDWBT/action/author_attestation","sign_citation":"https://pith.science/pith/5QDMP3DTO66MBVGL2AQ5BKDWBT/action/citation_signature","submit_replication":"https://pith.science/pith/5QDMP3DTO66MBVGL2AQ5BKDWBT/action/replication_record"}},"created_at":"2026-05-17T23:46:16.653286+00:00","updated_at":"2026-05-17T23:46:16.653286+00:00"}