{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:J7GUGCDNFNZ42MWUELHOTW2ZAA","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":"e56a5f0602dcf5105a89f2b5f5c775b5fc43859b7de4f1679d3854e999a82935","cross_cats_sorted":["cs.DS","math.CO","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-24T18:00:09Z","title_canon_sha256":"49b21d413251cf93d598cced78f01b111c2f8d18a74c5c70eef162d46507f84a"},"schema_version":"1.0","source":{"id":"2606.26244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.26244","created_at":"2026-06-26T00:15:30Z"},{"alias_kind":"arxiv_version","alias_value":"2606.26244v1","created_at":"2026-06-26T00:15:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26244","created_at":"2026-06-26T00:15:30Z"},{"alias_kind":"pith_short_12","alias_value":"J7GUGCDNFNZ4","created_at":"2026-06-26T00:15:30Z"},{"alias_kind":"pith_short_16","alias_value":"J7GUGCDNFNZ42MWU","created_at":"2026-06-26T00:15:30Z"},{"alias_kind":"pith_short_8","alias_value":"J7GUGCDN","created_at":"2026-06-26T00:15:30Z"}],"graph_snapshots":[{"event_id":"sha256:33b0857b74b258a3f9e77ec19af671caa7d1c990ff8186afd5e29a5ece11d637","target":"graph","created_at":"2026-06-26T00:15:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.26244/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce an approach to distinguishing isomorphism types of graphs based on vector spaces of polynomials that are set-wise invariant under permutations (\"separating modules,\" which are representations of the symmetric group), inspired by the Geometric Complexity Theory approach to separating complexity classes (Mulmuley & Sohoni, SIAM J. Comput., 2001). We characterize the power of this method for distinguishing non-isomorphic graphs under several different complexity measures:\n  - We show that separating modules of \"support-degree\" $k$ (each monomial touches at most $k$ vertices) are equi","authors_text":"Jacob Urisman, Joshua A. Grochow","cross_cats":["cs.DS","math.CO","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-24T18:00:09Z","title":"Graph Isomorphism and Representation Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26244","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:b162f44e6f47dc46493f3f44dd909caec6977b6ab4b4f03e05250d5dce58ed36","target":"record","created_at":"2026-06-26T00:15:30Z","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":"e56a5f0602dcf5105a89f2b5f5c775b5fc43859b7de4f1679d3854e999a82935","cross_cats_sorted":["cs.DS","math.CO","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-24T18:00:09Z","title_canon_sha256":"49b21d413251cf93d598cced78f01b111c2f8d18a74c5c70eef162d46507f84a"},"schema_version":"1.0","source":{"id":"2606.26244","kind":"arxiv","version":1}},"canonical_sha256":"4fcd43086d2b73cd32d422cee9db59001310508e5a5e2e497276b86c9842a115","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fcd43086d2b73cd32d422cee9db59001310508e5a5e2e497276b86c9842a115","first_computed_at":"2026-06-26T00:15:30.925456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T00:15:30.925456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e08xlHIHsyzJWhVIUbb4l+VW5BtZ22K7Qbh2mqv2LK+GQqPz7ICDYqlWiDWrEFecUt/fyYYjxmCrAce5MROgAQ==","signature_status":"signed_v1","signed_at":"2026-06-26T00:15:30.926034Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.26244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b162f44e6f47dc46493f3f44dd909caec6977b6ab4b4f03e05250d5dce58ed36","sha256:33b0857b74b258a3f9e77ec19af671caa7d1c990ff8186afd5e29a5ece11d637"],"state_sha256":"8368b0494e263ac33f0540eaa4757e45d2fee6219e86414d7726ec62a9f83122"}