{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SLDYNU3BHTQ7IPXVVYBAKY6VOT","short_pith_number":"pith:SLDYNU3B","schema_version":"1.0","canonical_sha256":"92c786d3613ce1f43ef5ae020563d574d80deaffc0f9019f349a30e1d748e7aa","source":{"kind":"arxiv","id":"1911.12877","version":1},"attestation_state":"computed","paper":{"title":"GraphZero: Breaking Symmetry for Efficient Graph Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.PF","authors_text":"Bo Wu, Connor Holmes, Daniel Mawhirter, Sam Reinehr, Tongping Liu","submitted_at":"2019-11-28T22:07:22Z","abstract_excerpt":"Graph mining for structural patterns is a fundamental task in many applications. Compilation-based graph mining systems, represented by AutoMine, generate specialized algorithms for the provided patterns and substantially outperform other systems. However, the generated code causes substantial computation redundancy and the compilation process incurs too much overhead to be used online, both due to the inherent symmetry in the structural patterns.\n  In this paper, we propose an optimizing compiler, GraphZero, to completely address these limitations through symmetry breaking based on group theo"},"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":"1911.12877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2019-11-28T22:07:22Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"2a8fc926b2704a78c35b66394ff66f4946777d70f1e96e6173a44d14e4102bb5","abstract_canon_sha256":"8a76dc9b061b5030c56477ebcfe77da80c44073a1e40a4e24be8f47b8e5437be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:22:49.871814Z","signature_b64":"utOzVckCwStz3GiXxFxviBJC9GVQyhLvPjTSBP8WmGmXnwDrFf4PKOJw/SEZAIv9AP3zGRL/LvYTF+MVlbY+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92c786d3613ce1f43ef5ae020563d574d80deaffc0f9019f349a30e1d748e7aa","last_reissued_at":"2026-07-05T00:22:49.871415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:22:49.871415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphZero: Breaking Symmetry for Efficient Graph Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.PF","authors_text":"Bo Wu, Connor Holmes, Daniel Mawhirter, Sam Reinehr, Tongping Liu","submitted_at":"2019-11-28T22:07:22Z","abstract_excerpt":"Graph mining for structural patterns is a fundamental task in many applications. Compilation-based graph mining systems, represented by AutoMine, generate specialized algorithms for the provided patterns and substantially outperform other systems. However, the generated code causes substantial computation redundancy and the compilation process incurs too much overhead to be used online, both due to the inherent symmetry in the structural patterns.\n  In this paper, we propose an optimizing compiler, GraphZero, to completely address these limitations through symmetry breaking based on group theo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.12877","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.12877/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.12877","created_at":"2026-07-05T00:22:49.871475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.12877v1","created_at":"2026-07-05T00:22:49.871475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.12877","created_at":"2026-07-05T00:22:49.871475+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLDYNU3BHTQ7","created_at":"2026-07-05T00:22:49.871475+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLDYNU3BHTQ7IPXV","created_at":"2026-07-05T00:22:49.871475+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLDYNU3B","created_at":"2026-07-05T00:22:49.871475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.14813","citing_title":"Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SLDYNU3BHTQ7IPXVVYBAKY6VOT","json":"https://pith.science/pith/SLDYNU3BHTQ7IPXVVYBAKY6VOT.json","graph_json":"https://pith.science/api/pith-number/SLDYNU3BHTQ7IPXVVYBAKY6VOT/graph.json","events_json":"https://pith.science/api/pith-number/SLDYNU3BHTQ7IPXVVYBAKY6VOT/events.json","paper":"https://pith.science/paper/SLDYNU3B"},"agent_actions":{"view_html":"https://pith.science/pith/SLDYNU3BHTQ7IPXVVYBAKY6VOT","download_json":"https://pith.science/pith/SLDYNU3BHTQ7IPXVVYBAKY6VOT.json","view_paper":"https://pith.science/paper/SLDYNU3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.12877&json=true","fetch_graph":"https://pith.science/api/pith-number/SLDYNU3BHTQ7IPXVVYBAKY6VOT/graph.json","fetch_events":"https://pith.science/api/pith-number/SLDYNU3BHTQ7IPXVVYBAKY6VOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLDYNU3BHTQ7IPXVVYBAKY6VOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLDYNU3BHTQ7IPXVVYBAKY6VOT/action/storage_attestation","attest_author":"https://pith.science/pith/SLDYNU3BHTQ7IPXVVYBAKY6VOT/action/author_attestation","sign_citation":"https://pith.science/pith/SLDYNU3BHTQ7IPXVVYBAKY6VOT/action/citation_signature","submit_replication":"https://pith.science/pith/SLDYNU3BHTQ7IPXVVYBAKY6VOT/action/replication_record"}},"created_at":"2026-07-05T00:22:49.871475+00:00","updated_at":"2026-07-05T00:22:49.871475+00:00"}