{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BSOHTNWS3TZDIRPJGKOS62UC52","short_pith_number":"pith:BSOHTNWS","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"},"canonical_sha256":"0c9c79b6d2dcf23445e9329d2f6a82ee9aa35f7f50d326bd06d9cdec29c383f1","source":{"kind":"arxiv","id":"1802.03760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03760","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03760v1","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03760","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"pith_short_12","alias_value":"BSOHTNWS3TZD","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BSOHTNWS3TZDIRPJ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BSOHTNWS","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BSOHTNWS3TZDIRPJGKOS62UC52","target":"record","payload":{"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"},"canonical_sha256":"0c9c79b6d2dcf23445e9329d2f6a82ee9aa35f7f50d326bd06d9cdec29c383f1","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"},"source_kind":"arxiv","source_id":"1802.03760","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:23:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vGUEt1jXhW+zKTtNYTCovZd7Y2Z2HsSxetFZevDd8wFvlSUf3RdA9Xs2wP1iv+j96sZ9qZ6UIkyfMRPlEoyiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:57:59.521426Z"},"content_sha256":"b0c3489daf9b78dbd56c3fb358c333c5efbe60f721d488b20cbb40a0da313dea","schema_version":"1.0","event_id":"sha256:b0c3489daf9b78dbd56c3fb358c333c5efbe60f721d488b20cbb40a0da313dea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BSOHTNWS3TZDIRPJGKOS62UC52","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:23:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VyIohmombihhGgyDOVC9yGl0f01aiSLmUS3O1rF7p3YiVm8yUcyCPFNsq2I1l5yUihSTO+gUrHqfFjrJy8TBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:57:59.522110Z"},"content_sha256":"989d4846c82b54d89280e1c4bfb4081a8828b7954f092a832c67e2353ecbac28","schema_version":"1.0","event_id":"sha256:989d4846c82b54d89280e1c4bfb4081a8828b7954f092a832c67e2353ecbac28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52/bundle.json","state_url":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSOHTNWS3TZDIRPJGKOS62UC52/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T15:57:59Z","links":{"resolver":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52","bundle":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52/bundle.json","state":"https://pith.science/pith/BSOHTNWS3TZDIRPJGKOS62UC52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSOHTNWS3TZDIRPJGKOS62UC52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BSOHTNWS3TZDIRPJGKOS62UC52","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6dc1473419638bd056efc8f267c263b2ca36e9f176b6b1448dc9fe2ce0bdebf4","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-11T16:08:47Z","title_canon_sha256":"5f4e293e05139ca052c33230c42d457491d9708eb1894f55b00671f0bdf60beb"},"schema_version":"1.0","source":{"id":"1802.03760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03760","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03760v1","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03760","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"pith_short_12","alias_value":"BSOHTNWS3TZD","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BSOHTNWS3TZDIRPJ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BSOHTNWS","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:989d4846c82b54d89280e1c4bfb4081a8828b7954f092a832c67e2353ecbac28","target":"graph","created_at":"2026-05-18T00:23:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Frank McSherry, Khaled Ammar, Manas Joglekar, Semih Salihoglu","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-11T16:08:47Z","title":"Distributed Evaluation of Subgraph Queries Using Worstcase Optimal LowMemory Dataflows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03760","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b0c3489daf9b78dbd56c3fb358c333c5efbe60f721d488b20cbb40a0da313dea","target":"record","created_at":"2026-05-18T00:23:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6dc1473419638bd056efc8f267c263b2ca36e9f176b6b1448dc9fe2ce0bdebf4","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-11T16:08:47Z","title_canon_sha256":"5f4e293e05139ca052c33230c42d457491d9708eb1894f55b00671f0bdf60beb"},"schema_version":"1.0","source":{"id":"1802.03760","kind":"arxiv","version":1}},"canonical_sha256":"0c9c79b6d2dcf23445e9329d2f6a82ee9aa35f7f50d326bd06d9cdec29c383f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c9c79b6d2dcf23445e9329d2f6a82ee9aa35f7f50d326bd06d9cdec29c383f1","first_computed_at":"2026-05-18T00:23:50.528219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:50.528219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VulXiW7ms3Sc1JCR+HrI6oAPdUy3FNkPLMHPGlhOXAXjJow01gX3dIsBL1nQWmPTxIC3ShVl7Nv0amckmu1QAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:50.528910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0c3489daf9b78dbd56c3fb358c333c5efbe60f721d488b20cbb40a0da313dea","sha256:989d4846c82b54d89280e1c4bfb4081a8828b7954f092a832c67e2353ecbac28"],"state_sha256":"528ef211c0d254c96ad7b8edaf3bddb5b7b0d5f94b75e5cf69b6c7160d60f618"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0TpeGBpJbUgySRgnmDmsUKf6VqHLZE472Jyb979C+mtM9mU84oCuikSnf5m4WbzffcyxiRW9Y/BVvtskS3k8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:57:59.526136Z","bundle_sha256":"bb1fb1f6335f02fb9b94e8239084b2bc3cff4f02de7ada9571ed3c0d61a7b3bd"}}