{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TBHYX5H3NGEC4NNFMPHQVJWOMI","short_pith_number":"pith:TBHYX5H3","schema_version":"1.0","canonical_sha256":"984f8bf4fb69882e35a563cf0aa6ce62180dbb8fe802738cc9491582b2e62621","source":{"kind":"arxiv","id":"2605.30730","version":1},"attestation_state":"computed","paper":{"title":"Vertex-transitive quantum graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.QA","quant-ph"],"primary_cat":"math.OA","authors_text":"Andre Kornell, Mac Hayes, Remi Salinas Schmeis, Trevor Jess","submitted_at":"2026-05-29T01:46:18Z","abstract_excerpt":"We define a quantum graph to be vertex-transitive if the join of its automorphism group is the maximum quantum relation on its quantum vertex set, in direct analogy with the classical case. All simple quantum graphs in $M_2(\\mathbb C)$ are vertex-transitive, but many simple quantum graphs in $M_3(\\mathbb C)$ are not vertex-transitive. We provide a complete classification of vertex-transitive quantum graphs in $M_3(\\mathbb C)$ up to isomorphism. To do this, we introduce a polynomial invariant for quantum graphs in $M_n(\\mathbb C)$, which we call the panoramic polynomial."},"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":"2605.30730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OA","submitted_at":"2026-05-29T01:46:18Z","cross_cats_sorted":["math.CO","math.QA","quant-ph"],"title_canon_sha256":"9626e2520498dc024eb488571153235c726aea2c07f1d9fe18c45759efdeba36","abstract_canon_sha256":"2b7e84be19ea7df99caea11ed07a7c593077b9c3c93237d929414c22213db410"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:12.829626Z","signature_b64":"yXS8DQkcX8mIpP5p1JD3xf0d4nbd4JaR7Wj419aZoUHWlLsZvXY88ZS7EGW0VeLomx97UxKS4vgZxlm5N4NLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"984f8bf4fb69882e35a563cf0aa6ce62180dbb8fe802738cc9491582b2e62621","last_reissued_at":"2026-06-01T01:03:12.828610Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:12.828610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex-transitive quantum graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.QA","quant-ph"],"primary_cat":"math.OA","authors_text":"Andre Kornell, Mac Hayes, Remi Salinas Schmeis, Trevor Jess","submitted_at":"2026-05-29T01:46:18Z","abstract_excerpt":"We define a quantum graph to be vertex-transitive if the join of its automorphism group is the maximum quantum relation on its quantum vertex set, in direct analogy with the classical case. All simple quantum graphs in $M_2(\\mathbb C)$ are vertex-transitive, but many simple quantum graphs in $M_3(\\mathbb C)$ are not vertex-transitive. We provide a complete classification of vertex-transitive quantum graphs in $M_3(\\mathbb C)$ up to isomorphism. To do this, we introduce a polynomial invariant for quantum graphs in $M_n(\\mathbb C)$, which we call the panoramic polynomial."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30730","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/2605.30730/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":"2605.30730","created_at":"2026-06-01T01:03:12.828767+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.30730v1","created_at":"2026-06-01T01:03:12.828767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30730","created_at":"2026-06-01T01:03:12.828767+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBHYX5H3NGEC","created_at":"2026-06-01T01:03:12.828767+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBHYX5H3NGEC4NNF","created_at":"2026-06-01T01:03:12.828767+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBHYX5H3","created_at":"2026-06-01T01:03:12.828767+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/TBHYX5H3NGEC4NNFMPHQVJWOMI","json":"https://pith.science/pith/TBHYX5H3NGEC4NNFMPHQVJWOMI.json","graph_json":"https://pith.science/api/pith-number/TBHYX5H3NGEC4NNFMPHQVJWOMI/graph.json","events_json":"https://pith.science/api/pith-number/TBHYX5H3NGEC4NNFMPHQVJWOMI/events.json","paper":"https://pith.science/paper/TBHYX5H3"},"agent_actions":{"view_html":"https://pith.science/pith/TBHYX5H3NGEC4NNFMPHQVJWOMI","download_json":"https://pith.science/pith/TBHYX5H3NGEC4NNFMPHQVJWOMI.json","view_paper":"https://pith.science/paper/TBHYX5H3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.30730&json=true","fetch_graph":"https://pith.science/api/pith-number/TBHYX5H3NGEC4NNFMPHQVJWOMI/graph.json","fetch_events":"https://pith.science/api/pith-number/TBHYX5H3NGEC4NNFMPHQVJWOMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBHYX5H3NGEC4NNFMPHQVJWOMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBHYX5H3NGEC4NNFMPHQVJWOMI/action/storage_attestation","attest_author":"https://pith.science/pith/TBHYX5H3NGEC4NNFMPHQVJWOMI/action/author_attestation","sign_citation":"https://pith.science/pith/TBHYX5H3NGEC4NNFMPHQVJWOMI/action/citation_signature","submit_replication":"https://pith.science/pith/TBHYX5H3NGEC4NNFMPHQVJWOMI/action/replication_record"}},"created_at":"2026-06-01T01:03:12.828767+00:00","updated_at":"2026-06-01T01:03:12.828767+00:00"}