{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:R5BO3F4EYAGYDX3K23E2NQ4YWW","short_pith_number":"pith:R5BO3F4E","schema_version":"1.0","canonical_sha256":"8f42ed9784c00d81df6ad6c9a6c398b5b263bea5e7aadcbe6e181d192a26b87b","source":{"kind":"arxiv","id":"1906.11518","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.11518","created_at":"2026-05-17T23:42:04.598784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11518v1","created_at":"2026-05-17T23:42:04.598784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11518","created_at":"2026-05-17T23:42:04.598784+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5BO3F4EYAGY","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5BO3F4EYAGYDX3K","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5BO3F4E","created_at":"2026-05-18T12:33:27.125529+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/R5BO3F4EYAGYDX3K23E2NQ4YWW","json":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW.json","graph_json":"https://pith.science/api/pith-number/R5BO3F4EYAGYDX3K23E2NQ4YWW/graph.json","events_json":"https://pith.science/api/pith-number/R5BO3F4EYAGYDX3K23E2NQ4YWW/events.json","paper":"https://pith.science/paper/R5BO3F4E"},"agent_actions":{"view_html":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW","download_json":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW.json","view_paper":"https://pith.science/paper/R5BO3F4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11518&json=true","fetch_graph":"https://pith.science/api/pith-number/R5BO3F4EYAGYDX3K23E2NQ4YWW/graph.json","fetch_events":"https://pith.science/api/pith-number/R5BO3F4EYAGYDX3K23E2NQ4YWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW/action/storage_attestation","attest_author":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW/action/author_attestation","sign_citation":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW/action/citation_signature","submit_replication":"https://pith.science/pith/R5BO3F4EYAGYDX3K23E2NQ4YWW/action/replication_record"}},"created_at":"2026-05-17T23:42:04.598784+00:00","updated_at":"2026-05-17T23:42:04.598784+00:00"}