{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FEV4JZYQL5CFTYSWIB4D5TDMTC","short_pith_number":"pith:FEV4JZYQ","schema_version":"1.0","canonical_sha256":"292bc4e7105f4459e25640783ecc6c98886cdce9c3d9b453403a5db41bc3e2af","source":{"kind":"arxiv","id":"1711.08289","version":1},"attestation_state":"computed","paper":{"title":"A Generic Framework for Engineering Graph Canonization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Merkle, Jakob L. Andersen","submitted_at":"2017-11-22T14:17:08Z","abstract_excerpt":"The state-of-the-art tools for practical graph canonization are all based on the individualization-refinement paradigm, and their difference is primarily in the choice of heuristics they include and in the actual tool implementation. It is thus not possible to make a direct comparison of how individual algorithmic ideas affect the performance on different graph classes.\n  We present an algorithmic software framework that facilitates implementation of heuristics as independent extensions to a common core algorithm. It therefore becomes easy to perform a detailed comparison of the performance an"},"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":"1711.08289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T14:17:08Z","cross_cats_sorted":[],"title_canon_sha256":"159b5179490fa0b2657f641574e6f5aa8c26ebdd84fa172b4229774b79d6eb1d","abstract_canon_sha256":"ff3cb35e44386e4324adffc1b6e57e2eaa22d648770e35c2dc66e1edd3e15a1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:50.186198Z","signature_b64":"W7m2Fiq/68IgxuQdD3FrWF0mYarDpjk79XzG1262PATh2FNLCvW9eqs9O3rcPubTpkt6BT8mpBvGNf2JweABBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"292bc4e7105f4459e25640783ecc6c98886cdce9c3d9b453403a5db41bc3e2af","last_reissued_at":"2026-05-18T00:29:50.185461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:50.185461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generic Framework for Engineering Graph Canonization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Merkle, Jakob L. Andersen","submitted_at":"2017-11-22T14:17:08Z","abstract_excerpt":"The state-of-the-art tools for practical graph canonization are all based on the individualization-refinement paradigm, and their difference is primarily in the choice of heuristics they include and in the actual tool implementation. It is thus not possible to make a direct comparison of how individual algorithmic ideas affect the performance on different graph classes.\n  We present an algorithmic software framework that facilitates implementation of heuristics as independent extensions to a common core algorithm. It therefore becomes easy to perform a detailed comparison of the performance an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08289","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":"1711.08289","created_at":"2026-05-18T00:29:50.185582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08289v1","created_at":"2026-05-18T00:29:50.185582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08289","created_at":"2026-05-18T00:29:50.185582+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEV4JZYQL5CF","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEV4JZYQL5CFTYSW","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEV4JZYQ","created_at":"2026-05-18T12:31:15.632608+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/FEV4JZYQL5CFTYSWIB4D5TDMTC","json":"https://pith.science/pith/FEV4JZYQL5CFTYSWIB4D5TDMTC.json","graph_json":"https://pith.science/api/pith-number/FEV4JZYQL5CFTYSWIB4D5TDMTC/graph.json","events_json":"https://pith.science/api/pith-number/FEV4JZYQL5CFTYSWIB4D5TDMTC/events.json","paper":"https://pith.science/paper/FEV4JZYQ"},"agent_actions":{"view_html":"https://pith.science/pith/FEV4JZYQL5CFTYSWIB4D5TDMTC","download_json":"https://pith.science/pith/FEV4JZYQL5CFTYSWIB4D5TDMTC.json","view_paper":"https://pith.science/paper/FEV4JZYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08289&json=true","fetch_graph":"https://pith.science/api/pith-number/FEV4JZYQL5CFTYSWIB4D5TDMTC/graph.json","fetch_events":"https://pith.science/api/pith-number/FEV4JZYQL5CFTYSWIB4D5TDMTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEV4JZYQL5CFTYSWIB4D5TDMTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEV4JZYQL5CFTYSWIB4D5TDMTC/action/storage_attestation","attest_author":"https://pith.science/pith/FEV4JZYQL5CFTYSWIB4D5TDMTC/action/author_attestation","sign_citation":"https://pith.science/pith/FEV4JZYQL5CFTYSWIB4D5TDMTC/action/citation_signature","submit_replication":"https://pith.science/pith/FEV4JZYQL5CFTYSWIB4D5TDMTC/action/replication_record"}},"created_at":"2026-05-18T00:29:50.185582+00:00","updated_at":"2026-05-18T00:29:50.185582+00:00"}