{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JI7O2D5BPU7I2BUC7C235BCPI5","short_pith_number":"pith:JI7O2D5B","canonical_record":{"source":{"id":"1407.3745","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DB","submitted_at":"2014-07-14T17:53:30Z","cross_cats_sorted":[],"title_canon_sha256":"cb65032466e3f044b735726c26b7d0e45ec2b9ec339f04030d97fa0684f313df","abstract_canon_sha256":"f5942f6dc23f7e25fd49912b923acbae2836669ac948c04056e6816711c8e95d"},"schema_version":"1.0"},"canonical_sha256":"4a3eed0fa17d3e8d0682f8b5be844f4747b987694b91b1c32a812e23db6dd20a","source":{"kind":"arxiv","id":"1407.3745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3745","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3745v1","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3745","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"JI7O2D5BPU7I","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JI7O2D5BPU7I2BUC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JI7O2D5B","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JI7O2D5BPU7I2BUC7C235BCPI5","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3745","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DB","submitted_at":"2014-07-14T17:53:30Z","cross_cats_sorted":[],"title_canon_sha256":"cb65032466e3f044b735726c26b7d0e45ec2b9ec339f04030d97fa0684f313df","abstract_canon_sha256":"f5942f6dc23f7e25fd49912b923acbae2836669ac948c04056e6816711c8e95d"},"schema_version":"1.0"},"canonical_sha256":"4a3eed0fa17d3e8d0682f8b5be844f4747b987694b91b1c32a812e23db6dd20a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:41.797228Z","signature_b64":"ygy5c5G/2SIYWkwGc62oeRXDIfHRw/zMmUcGvE5HBQtpcN2TYwppZvs/3R1Y0rboUm4GzShd/h2L7y/+wbR+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a3eed0fa17d3e8d0682f8b5be844f4747b987694b91b1c32a812e23db6dd20a","last_reissued_at":"2026-05-18T02:47:41.796389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:41.796389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3745","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-18T02:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVI5U2OSbgKo+29J7TZY1CBQQCzTJ7EQYCzBwoUg635rrNcd+WVxB8QBr7K44KPbVgEvaK7un7Y757VAIVSpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:21:43.876764Z"},"content_sha256":"f3fb9faeeebb365695bfe908b53a32b249b1d53c15e7f93dabe142f418cecbe8","schema_version":"1.0","event_id":"sha256:f3fb9faeeebb365695bfe908b53a32b249b1d53c15e7f93dabe142f418cecbe8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JI7O2D5BPU7I2BUC7C235BCPI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Query Optimization for Dynamic Graphs","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"George Chin, John Feo, Khushbu Agarwal, Lawrence Holder, Patrick Mackey, Sutanay Choudhury","submitted_at":"2014-07-14T17:53:30Z","abstract_excerpt":"Given a query graph that represents a pattern of interest, the emerging pattern detection problem can be viewed as a continuous query problem on a dynamic graph. We present an incremental algorithm for continuous query processing on dynamic graphs. The algorithm is based on the concept of query decomposition; we decompose a query graph into smaller subgraphs and assemble the result of sub-queries to find complete matches with the specified query. The novelty of our work lies in using the subgraph distributional statistics collected from the dynamic graph to generate the decomposition. We intro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3745","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-18T02:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mB+rJwTZ2BN1t7tSPJvjkq3O+PpAPlJtNitP1JPZlJT5PFv1k/DeNu+xi2ADzbAHKH+O76h/OdZEoUa++9r6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:21:43.877130Z"},"content_sha256":"e4e72a788ab3aa0e23fd02f4863837fd87e888e47029b584ef5c2e6a4df6d80b","schema_version":"1.0","event_id":"sha256:e4e72a788ab3aa0e23fd02f4863837fd87e888e47029b584ef5c2e6a4df6d80b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JI7O2D5BPU7I2BUC7C235BCPI5/bundle.json","state_url":"https://pith.science/pith/JI7O2D5BPU7I2BUC7C235BCPI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JI7O2D5BPU7I2BUC7C235BCPI5/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-27T04:21:43Z","links":{"resolver":"https://pith.science/pith/JI7O2D5BPU7I2BUC7C235BCPI5","bundle":"https://pith.science/pith/JI7O2D5BPU7I2BUC7C235BCPI5/bundle.json","state":"https://pith.science/pith/JI7O2D5BPU7I2BUC7C235BCPI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JI7O2D5BPU7I2BUC7C235BCPI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JI7O2D5BPU7I2BUC7C235BCPI5","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":"f5942f6dc23f7e25fd49912b923acbae2836669ac948c04056e6816711c8e95d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DB","submitted_at":"2014-07-14T17:53:30Z","title_canon_sha256":"cb65032466e3f044b735726c26b7d0e45ec2b9ec339f04030d97fa0684f313df"},"schema_version":"1.0","source":{"id":"1407.3745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3745","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3745v1","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3745","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"JI7O2D5BPU7I","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JI7O2D5BPU7I2BUC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JI7O2D5B","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:e4e72a788ab3aa0e23fd02f4863837fd87e888e47029b584ef5c2e6a4df6d80b","target":"graph","created_at":"2026-05-18T02:47:41Z","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":"Given a query graph that represents a pattern of interest, the emerging pattern detection problem can be viewed as a continuous query problem on a dynamic graph. We present an incremental algorithm for continuous query processing on dynamic graphs. The algorithm is based on the concept of query decomposition; we decompose a query graph into smaller subgraphs and assemble the result of sub-queries to find complete matches with the specified query. The novelty of our work lies in using the subgraph distributional statistics collected from the dynamic graph to generate the decomposition. We intro","authors_text":"George Chin, John Feo, Khushbu Agarwal, Lawrence Holder, Patrick Mackey, Sutanay Choudhury","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DB","submitted_at":"2014-07-14T17:53:30Z","title":"Query Optimization for Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3745","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:f3fb9faeeebb365695bfe908b53a32b249b1d53c15e7f93dabe142f418cecbe8","target":"record","created_at":"2026-05-18T02:47:41Z","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":"f5942f6dc23f7e25fd49912b923acbae2836669ac948c04056e6816711c8e95d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DB","submitted_at":"2014-07-14T17:53:30Z","title_canon_sha256":"cb65032466e3f044b735726c26b7d0e45ec2b9ec339f04030d97fa0684f313df"},"schema_version":"1.0","source":{"id":"1407.3745","kind":"arxiv","version":1}},"canonical_sha256":"4a3eed0fa17d3e8d0682f8b5be844f4747b987694b91b1c32a812e23db6dd20a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a3eed0fa17d3e8d0682f8b5be844f4747b987694b91b1c32a812e23db6dd20a","first_computed_at":"2026-05-18T02:47:41.796389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:41.796389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ygy5c5G/2SIYWkwGc62oeRXDIfHRw/zMmUcGvE5HBQtpcN2TYwppZvs/3R1Y0rboUm4GzShd/h2L7y/+wbR+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:41.797228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3fb9faeeebb365695bfe908b53a32b249b1d53c15e7f93dabe142f418cecbe8","sha256:e4e72a788ab3aa0e23fd02f4863837fd87e888e47029b584ef5c2e6a4df6d80b"],"state_sha256":"8910db5e681166ec89b32533192a0528762f6f710b2616351feaf7d634a3927c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2q6M6C5d5ujmDAyQUJYcEEgPBBfg7qoGu4XF8fmQ103q8+XYntrnCUN90ophmrvMK4teamGu/kJROLRygltAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:21:43.879400Z","bundle_sha256":"4e063e268be8a0f248e05e94b1e8991e2c4f86c56ce6355a5c4ddbcad797f06e"}}