{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:R5BO3F4EYAGYDX3K23E2NQ4YWW","short_pith_number":"pith:R5BO3F4E","canonical_record":{"source":{"id":"1906.11518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-27T09:38:46Z","cross_cats_sorted":[],"title_canon_sha256":"133babf185dbfe95abae608830ed6b330d6b9eb6ccec9a235522b5602aaf57b6","abstract_canon_sha256":"2eca46e1e6fc7f25a287193221897a5bedb8fb502196dfdef2dc07c365ea20bb"},"schema_version":"1.0"},"canonical_sha256":"8f42ed9784c00d81df6ad6c9a6c398b5b263bea5e7aadcbe6e181d192a26b87b","source":{"kind":"arxiv","id":"1906.11518","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11518","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11518v1","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11518","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"pith_short_12","alias_value":"R5BO3F4EYAGY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"R5BO3F4EYAGYDX3K","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"R5BO3F4E","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:R5BO3F4EYAGYDX3K23E2NQ4YWW","target":"record","payload":{"canonical_record":{"source":{"id":"1906.11518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-27T09:38:46Z","cross_cats_sorted":[],"title_canon_sha256":"133babf185dbfe95abae608830ed6b330d6b9eb6ccec9a235522b5602aaf57b6","abstract_canon_sha256":"2eca46e1e6fc7f25a287193221897a5bedb8fb502196dfdef2dc07c365ea20bb"},"schema_version":"1.0"},"canonical_sha256":"8f42ed9784c00d81df6ad6c9a6c398b5b263bea5e7aadcbe6e181d192a26b87b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:04.599350Z","signature_b64":"EDMzjLE97+A5yXjQ8K8ww58UMeUd8jS578LjMvfhVNcX3oe/Iv+LTZ6IpLxsl6ySgDZ2JTTFk5ieDWOqjEcKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f42ed9784c00d81df6ad6c9a6c398b5b263bea5e7aadcbe6e181d192a26b87b","last_reissued_at":"2026-05-17T23:42:04.598666Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:04.598666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.11518","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-17T23:42:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dYPMgGzlrMxg7CBlhx17qovglLfYjGAZhh1Uk8xuTsIMJX9up1c++LFVpI4JoDjOPv3fGJIh4C+aZZROD8RpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:59:56.696354Z"},"content_sha256":"5c81237b3fa7c7ce476baa5f540a77c043e024ec56d2736c570ce45fb42b0db4","schema_version":"1.0","event_id":"sha256:5c81237b3fa7c7ce476baa5f540a77c043e024ec56d2736c570ce45fb42b0db4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:R5BO3F4EYAGYDX3K23E2NQ4YWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Survey and Experimental Analysis of Distributed Subgraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jingren Zhou, Kongzhang Hao, Longbin Lai, Lu Qin, Ran Wang, Wenjie Zhang, Xin Jin, Xuemin Lin, Ying Zhang, Zhengmin Lai, Zhengping Qian, Zhengyi Yang, Zhu Qing","submitted_at":"2019-06-27T09:38:46Z","abstract_excerpt":"Recently there emerge many distributed algorithms that aim at solving subgraph matching at scale. Existing algorithm-level comparisons failed to provide a systematic view to the pros and cons of each algorithm mainly due to the intertwining of strategy and optimization. In this paper, we identify four strategies and three general-purpose optimizations from representative state-of-the-art works. We implement the four strategies with the optimizations based on the common Timely dataflow system for systematic strategy-level comparison. Our implementation covers all representation algorithms. We c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11518","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-17T23:42:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"idAEQ/K7AvwhjkFcFGM7M8sHC36DAta1QUKuAlOjBRw83RkMQ0nBX8TC5KPjk821VqFGA/St59X98OCvxw6cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:59:56.696707Z"},"content_sha256":"d95f9214352ff2d7e182e443c81c9f01c28bcaa4624ec5b697193d0652696f81","schema_version":"1.0","event_id":"sha256:d95f9214352ff2d7e182e443c81c9f01c28bcaa4624ec5b697193d0652696f81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW/bundle.json","state_url":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW/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-06-05T13:59:56Z","links":{"resolver":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW","bundle":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW/bundle.json","state":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:R5BO3F4EYAGYDX3K23E2NQ4YWW","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":"2eca46e1e6fc7f25a287193221897a5bedb8fb502196dfdef2dc07c365ea20bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-27T09:38:46Z","title_canon_sha256":"133babf185dbfe95abae608830ed6b330d6b9eb6ccec9a235522b5602aaf57b6"},"schema_version":"1.0","source":{"id":"1906.11518","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11518","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11518v1","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11518","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"pith_short_12","alias_value":"R5BO3F4EYAGY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"R5BO3F4EYAGYDX3K","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"R5BO3F4E","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:d95f9214352ff2d7e182e443c81c9f01c28bcaa4624ec5b697193d0652696f81","target":"graph","created_at":"2026-05-17T23:42:04Z","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":"Recently there emerge many distributed algorithms that aim at solving subgraph matching at scale. Existing algorithm-level comparisons failed to provide a systematic view to the pros and cons of each algorithm mainly due to the intertwining of strategy and optimization. In this paper, we identify four strategies and three general-purpose optimizations from representative state-of-the-art works. We implement the four strategies with the optimizations based on the common Timely dataflow system for systematic strategy-level comparison. Our implementation covers all representation algorithms. We c","authors_text":"Jingren Zhou, Kongzhang Hao, Longbin Lai, Lu Qin, Ran Wang, Wenjie Zhang, Xin Jin, Xuemin Lin, Ying Zhang, Zhengmin Lai, Zhengping Qian, Zhengyi Yang, Zhu Qing","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-27T09:38:46Z","title":"A Survey and Experimental Analysis of Distributed Subgraph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11518","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:5c81237b3fa7c7ce476baa5f540a77c043e024ec56d2736c570ce45fb42b0db4","target":"record","created_at":"2026-05-17T23:42:04Z","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":"2eca46e1e6fc7f25a287193221897a5bedb8fb502196dfdef2dc07c365ea20bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-27T09:38:46Z","title_canon_sha256":"133babf185dbfe95abae608830ed6b330d6b9eb6ccec9a235522b5602aaf57b6"},"schema_version":"1.0","source":{"id":"1906.11518","kind":"arxiv","version":1}},"canonical_sha256":"8f42ed9784c00d81df6ad6c9a6c398b5b263bea5e7aadcbe6e181d192a26b87b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f42ed9784c00d81df6ad6c9a6c398b5b263bea5e7aadcbe6e181d192a26b87b","first_computed_at":"2026-05-17T23:42:04.598666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:04.598666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EDMzjLE97+A5yXjQ8K8ww58UMeUd8jS578LjMvfhVNcX3oe/Iv+LTZ6IpLxsl6ySgDZ2JTTFk5ieDWOqjEcKAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:04.599350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11518","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c81237b3fa7c7ce476baa5f540a77c043e024ec56d2736c570ce45fb42b0db4","sha256:d95f9214352ff2d7e182e443c81c9f01c28bcaa4624ec5b697193d0652696f81"],"state_sha256":"9d3583d5bb0cbc01052fdf1e8b97ccd162f60de6c5263bf6c1b34aac6a40a06f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vwyy20TF++dnsHyuVWA6xy6+fL1JuSydjM1xnbHqhOCvh/V2nIoM6N4YQ8RRZj8BZZfnGGm9ICTg6YPIN2fLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:59:56.698651Z","bundle_sha256":"720552bb471934b414140341d2c1156329c7ac4346e650b318d5c9260ddcf83d"}}