{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NQKDHSA5RLZMU2RQEQQH5YVHIY","short_pith_number":"pith:NQKDHSA5","canonical_record":{"source":{"id":"1306.2405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-11T02:02:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8ed14ed7a81133587e57b587624c87c98eebc2335183ad1fcf7dbccb9c9c0c89","abstract_canon_sha256":"d8284979c3d877dd0e8ac9cf55f584abaccc906bc986d2be434df3dd963334c1"},"schema_version":"1.0"},"canonical_sha256":"6c1433c81d8af2ca6a3024207ee2a7462a95ad7291c67e30933500449a105997","source":{"kind":"arxiv","id":"1306.2405","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2405","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2405v1","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2405","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"pith_short_12","alias_value":"NQKDHSA5RLZM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NQKDHSA5RLZMU2RQ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NQKDHSA5","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NQKDHSA5RLZMU2RQEQQH5YVHIY","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-11T02:02:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8ed14ed7a81133587e57b587624c87c98eebc2335183ad1fcf7dbccb9c9c0c89","abstract_canon_sha256":"d8284979c3d877dd0e8ac9cf55f584abaccc906bc986d2be434df3dd963334c1"},"schema_version":"1.0"},"canonical_sha256":"6c1433c81d8af2ca6a3024207ee2a7462a95ad7291c67e30933500449a105997","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:21.066509Z","signature_b64":"1GWVcWWPfQohcIKKjvyFFyi0dzPH5i8dmDkpfTITW/FBE98pSJslROWY8IaKxskNBgrca9tcT16ErgPOSiq5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c1433c81d8af2ca6a3024207ee2a7462a95ad7291c67e30933500449a105997","last_reissued_at":"2026-05-18T03:21:21.066023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:21.066023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2405","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-18T03:21:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uo6n7GsIo3P0D1XoX01ggf1VtcnLbW/xzeO1KDKJ2H7G+TYFooE00d8LavbUpAkz0wJIedURgCKfh8lwGtaHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:45:05.954608Z"},"content_sha256":"0f4b3a6f7a49211fa55334ddb516fc9a1f3bb0334f4c6a21c16c726230fdae12","schema_version":"1.0","event_id":"sha256:0f4b3a6f7a49211fa55334ddb516fc9a1f3bb0334f4c6a21c16c726230fdae12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NQKDHSA5RLZMU2RQEQQH5YVHIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Canonical Labelling of Site Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Cambridge, Cambridge University, Edinburgh, Edinburgh University, Michael Pedersen (Department of Plant Sciences, Nicolas Oury (School of Informatics, Rasmus Petersen (Microsoft Research, Scotland), UK)","submitted_at":"2013-06-11T02:02:41Z","abstract_excerpt":"We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with \"many\" aut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2405","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-18T03:21:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WLojf1U5Z6EQKpYmscwximnFtAqSAq6HkA5JC7OAbIjofi6auyyI9Ur34SyI6gjlR53EzS+YHfywNKYvDAkBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:45:05.955262Z"},"content_sha256":"d5f4b6bc2d8b41175282e4c1e83452d8ea30c74d1024ba640f7557f1c8b21cc0","schema_version":"1.0","event_id":"sha256:d5f4b6bc2d8b41175282e4c1e83452d8ea30c74d1024ba640f7557f1c8b21cc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQKDHSA5RLZMU2RQEQQH5YVHIY/bundle.json","state_url":"https://pith.science/pith/NQKDHSA5RLZMU2RQEQQH5YVHIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQKDHSA5RLZMU2RQEQQH5YVHIY/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-28T23:45:05Z","links":{"resolver":"https://pith.science/pith/NQKDHSA5RLZMU2RQEQQH5YVHIY","bundle":"https://pith.science/pith/NQKDHSA5RLZMU2RQEQQH5YVHIY/bundle.json","state":"https://pith.science/pith/NQKDHSA5RLZMU2RQEQQH5YVHIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQKDHSA5RLZMU2RQEQQH5YVHIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NQKDHSA5RLZMU2RQEQQH5YVHIY","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":"d8284979c3d877dd0e8ac9cf55f584abaccc906bc986d2be434df3dd963334c1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-11T02:02:41Z","title_canon_sha256":"8ed14ed7a81133587e57b587624c87c98eebc2335183ad1fcf7dbccb9c9c0c89"},"schema_version":"1.0","source":{"id":"1306.2405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2405","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2405v1","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2405","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"pith_short_12","alias_value":"NQKDHSA5RLZM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NQKDHSA5RLZMU2RQ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NQKDHSA5","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:d5f4b6bc2d8b41175282e4c1e83452d8ea30c74d1024ba640f7557f1c8b21cc0","target":"graph","created_at":"2026-05-18T03:21:21Z","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":"We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with \"many\" aut","authors_text":"Cambridge, Cambridge University, Edinburgh, Edinburgh University, Michael Pedersen (Department of Plant Sciences, Nicolas Oury (School of Informatics, Rasmus Petersen (Microsoft Research, Scotland), UK)","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-11T02:02:41Z","title":"Canonical Labelling of Site Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2405","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:0f4b3a6f7a49211fa55334ddb516fc9a1f3bb0334f4c6a21c16c726230fdae12","target":"record","created_at":"2026-05-18T03:21:21Z","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":"d8284979c3d877dd0e8ac9cf55f584abaccc906bc986d2be434df3dd963334c1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-11T02:02:41Z","title_canon_sha256":"8ed14ed7a81133587e57b587624c87c98eebc2335183ad1fcf7dbccb9c9c0c89"},"schema_version":"1.0","source":{"id":"1306.2405","kind":"arxiv","version":1}},"canonical_sha256":"6c1433c81d8af2ca6a3024207ee2a7462a95ad7291c67e30933500449a105997","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c1433c81d8af2ca6a3024207ee2a7462a95ad7291c67e30933500449a105997","first_computed_at":"2026-05-18T03:21:21.066023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:21.066023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1GWVcWWPfQohcIKKjvyFFyi0dzPH5i8dmDkpfTITW/FBE98pSJslROWY8IaKxskNBgrca9tcT16ErgPOSiq5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:21.066509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f4b3a6f7a49211fa55334ddb516fc9a1f3bb0334f4c6a21c16c726230fdae12","sha256:d5f4b6bc2d8b41175282e4c1e83452d8ea30c74d1024ba640f7557f1c8b21cc0"],"state_sha256":"1945167561e0832c9d17f18bd73f50dd56ba4690d7215303425d8fec3ceff4ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeT4nwjpQyxpU5CnTB95v/lb1yzVJdNlGWASVVyaDCoHr8AZl34PRvFR2gkAzS6+teC8dPQOT80usEvzvRJ/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:45:05.959056Z","bundle_sha256":"ba2f872da2773dd265fd3467f0ea3be327301619cef0dd137feae2d5daae5cfe"}}