{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KUIMY5CSJNW4SPSDFWIVT7V3SW","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":"1e9a95051c1a67bd88d9402ac8df018a3208e10c369fc85a825a8bd1a8939217","cross_cats_sorted":["cs.CC","math.AC","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-09T19:02:45Z","title_canon_sha256":"0d660731a57f2da607942848674fe7d52d8901e2b453b757b8131e859c47762e"},"schema_version":"1.0","source":{"id":"1012.2081","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2081","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2081v1","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2081","created_at":"2026-05-18T04:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"KUIMY5CSJNW4","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KUIMY5CSJNW4SPSD","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KUIMY5CS","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:619893f8dd9825e001dc934f20636189a3ced856206e980a4cd004d29648a444","target":"graph","created_at":"2026-05-18T04:33:49Z","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":"It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many pairs of graphs, but the pairs of non-isomorphic graphs constructed by Cai, Furer and Immerman it cannot distinguish. If d is fixed, then the WL-algorithm runs in polynomial time. We will formulate the Graph Isomorphism Problem as an Orbit Problem: Given a representation V of an algebraic group G and two elements v_1,v_2 in V, decide whether v_1 and v_2 lie i","authors_text":"Harm Derksen","cross_cats":["cs.CC","math.AC","math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-09T19:02:45Z","title":"The Graph Isomorphism Problem and approximate categories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2081","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:854ab747719e7238599742646c94ad0422483aebb22cefb09687c4d00bfba518","target":"record","created_at":"2026-05-18T04:33:49Z","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":"1e9a95051c1a67bd88d9402ac8df018a3208e10c369fc85a825a8bd1a8939217","cross_cats_sorted":["cs.CC","math.AC","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-09T19:02:45Z","title_canon_sha256":"0d660731a57f2da607942848674fe7d52d8901e2b453b757b8131e859c47762e"},"schema_version":"1.0","source":{"id":"1012.2081","kind":"arxiv","version":1}},"canonical_sha256":"5510cc74524b6dc93e432d9159febb95b1c5e2324eedec8a31f2176f23c100d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5510cc74524b6dc93e432d9159febb95b1c5e2324eedec8a31f2176f23c100d1","first_computed_at":"2026-05-18T04:33:49.033164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:49.033164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b5iHtStFzvVho3C4z2tbiqvlaLHlQx4JvMhmbBJu16ZZHgbZZqmEA3HWPjFIB/okCnd/nnaZmXm9jeZ+JQqmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:49.033693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2081","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:854ab747719e7238599742646c94ad0422483aebb22cefb09687c4d00bfba518","sha256:619893f8dd9825e001dc934f20636189a3ced856206e980a4cd004d29648a444"],"state_sha256":"28def1eb08da16eeb42b5193d09b8a23ae4d0af27f38c58b34f8650b0a95a71f"}