{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BSOHTNWS3TZDIRPJGKOS62UC52","short_pith_number":"pith:BSOHTNWS","schema_version":"1.0","canonical_sha256":"0c9c79b6d2dcf23445e9329d2f6a82ee9aa35f7f50d326bd06d9cdec29c383f1","source":{"kind":"arxiv","id":"1802.03760","version":1},"attestation_state":"computed","paper":{"title":"Distributed Evaluation of Subgraph Queries Using Worstcase Optimal LowMemory Dataflows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Frank McSherry, Khaled Ammar, Manas Joglekar, Semih Salihoglu","submitted_at":"2018-02-11T16:08:47Z","abstract_excerpt":"We study the problem of finding and monitoring fixed-size subgraphs in a continually changing large-scale graph. We present the first approach that (i) performs worst-case optimal computation and communication, (ii) maintains a total memory footprint linear in the number of input edges, and (iii) scales down per-worker computation, communication, and memory requirements linearly as the number of workers increases, even on adversarially skewed inputs.\n  Our approach is based on worst-case optimal join algorithms, recast as a data-parallel dataflow computation. We describe the general algorithm "},"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":"1802.03760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-11T16:08:47Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"5f4e293e05139ca052c33230c42d457491d9708eb1894f55b00671f0bdf60beb","abstract_canon_sha256":"6dc1473419638bd056efc8f267c263b2ca36e9f176b6b1448dc9fe2ce0bdebf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:50.528910Z","signature_b64":"VulXiW7ms3Sc1JCR+HrI6oAPdUy3FNkPLMHPGlhOXAXjJow01gX3dIsBL1nQWmPTxIC3ShVl7Nv0amckmu1QAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c9c79b6d2dcf23445e9329d2f6a82ee9aa35f7f50d326bd06d9cdec29c383f1","last_reissued_at":"2026-05-18T00:23:50.528219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:50.528219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Evaluation of Subgraph Queries Using Worstcase Optimal LowMemory Dataflows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Frank McSherry, Khaled Ammar, Manas Joglekar, Semih Salihoglu","submitted_at":"2018-02-11T16:08:47Z","abstract_excerpt":"We study the problem of finding and monitoring fixed-size subgraphs in a continually changing large-scale graph. We present the first approach that (i) performs worst-case optimal computation and communication, (ii) maintains a total memory footprint linear in the number of input edges, and (iii) scales down per-worker computation, communication, and memory requirements linearly as the number of workers increases, even on adversarially skewed inputs.\n  Our approach is based on worst-case optimal join algorithms, recast as a data-parallel dataflow computation. We describe the general algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03760","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":"1802.03760","created_at":"2026-05-18T00:23:50.528329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03760v1","created_at":"2026-05-18T00:23:50.528329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03760","created_at":"2026-05-18T00:23:50.528329+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSOHTNWS3TZD","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSOHTNWS3TZDIRPJ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSOHTNWS","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22843","citing_title":"Structure Guided Retrieval-Augmented Generation for Factual Queries","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52","json":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52.json","graph_json":"https://pith.science/api/pith-number/BSOHTNWS3TZDIRPJGKOS62UC52/graph.json","events_json":"https://pith.science/api/pith-number/BSOHTNWS3TZDIRPJGKOS62UC52/events.json","paper":"https://pith.science/paper/BSOHTNWS"},"agent_actions":{"view_html":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52","download_json":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52.json","view_paper":"https://pith.science/paper/BSOHTNWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03760&json=true","fetch_graph":"https://pith.science/api/pith-number/BSOHTNWS3TZDIRPJGKOS62UC52/graph.json","fetch_events":"https://pith.science/api/pith-number/BSOHTNWS3TZDIRPJGKOS62UC52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52/action/storage_attestation","attest_author":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52/action/author_attestation","sign_citation":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52/action/citation_signature","submit_replication":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52/action/replication_record"}},"created_at":"2026-05-18T00:23:50.528329+00:00","updated_at":"2026-05-18T00:23:50.528329+00:00"}