{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:UWZZPFTSVBSD2WKVIB6QZLVV22","short_pith_number":"pith:UWZZPFTS","schema_version":"1.0","canonical_sha256":"a5b3979672a8643d5955407d0caeb5d68848072ba2d3906bf240b4471082ea42","source":{"kind":"arxiv","id":"2004.10893","version":1},"attestation_state":"computed","paper":{"title":"Graph isomorphism: Physical resources, optimization models, and algebraic characterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antonios Varvitsiotis, David E. Roberson, Laura Man\\v{c}inska","submitted_at":"2020-04-22T23:13:53Z","abstract_excerpt":"In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$ and $H$ are isomorphic. In recent work along with Atserias, \\v{S}\\'amal and Severini [Journal of Combinatorial Theory, Series B, 136:89--328, 2019] we showed that a verifier can be convinced that two non-isomorphic graphs are isomorphic, if the provers are allowed to share quantum resources. In this paper we model classical and quantum graph isomorphism by lin"},"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":"2004.10893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-22T23:13:53Z","cross_cats_sorted":[],"title_canon_sha256":"64007ceb43949000fea1427e94dd9a20e33f2b6fa5b69e6c61c1d84de2822520","abstract_canon_sha256":"d70824f646148caa1bd10dbc963c178f3b77d62d3ae03ac1c7aabad2cec422fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:57:37.064272Z","signature_b64":"j3HjTXi4WvZ36lj+Ri+gEbdJVw4WWcBt0PFsLh/bx71jqHc5a2O5aeOmUiFmFX4B9IDaOdpXpn0R9em2QAkTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5b3979672a8643d5955407d0caeb5d68848072ba2d3906bf240b4471082ea42","last_reissued_at":"2026-07-05T00:57:37.063645Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:57:37.063645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph isomorphism: Physical resources, optimization models, and algebraic characterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antonios Varvitsiotis, David E. Roberson, Laura Man\\v{c}inska","submitted_at":"2020-04-22T23:13:53Z","abstract_excerpt":"In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$ and $H$ are isomorphic. In recent work along with Atserias, \\v{S}\\'amal and Severini [Journal of Combinatorial Theory, Series B, 136:89--328, 2019] we showed that a verifier can be convinced that two non-isomorphic graphs are isomorphic, if the provers are allowed to share quantum resources. In this paper we model classical and quantum graph isomorphism by lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.10893","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/2004.10893/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":"2004.10893","created_at":"2026-07-05T00:57:37.063773+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.10893v1","created_at":"2026-07-05T00:57:37.063773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.10893","created_at":"2026-07-05T00:57:37.063773+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWZZPFTSVBSD","created_at":"2026-07-05T00:57:37.063773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWZZPFTSVBSD2WKV","created_at":"2026-07-05T00:57:37.063773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWZZPFTS","created_at":"2026-07-05T00:57:37.063773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00196","citing_title":"Group Invariant Quantum Latin Squares","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UWZZPFTSVBSD2WKVIB6QZLVV22","json":"https://pith.science/pith/UWZZPFTSVBSD2WKVIB6QZLVV22.json","graph_json":"https://pith.science/api/pith-number/UWZZPFTSVBSD2WKVIB6QZLVV22/graph.json","events_json":"https://pith.science/api/pith-number/UWZZPFTSVBSD2WKVIB6QZLVV22/events.json","paper":"https://pith.science/paper/UWZZPFTS"},"agent_actions":{"view_html":"https://pith.science/pith/UWZZPFTSVBSD2WKVIB6QZLVV22","download_json":"https://pith.science/pith/UWZZPFTSVBSD2WKVIB6QZLVV22.json","view_paper":"https://pith.science/paper/UWZZPFTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.10893&json=true","fetch_graph":"https://pith.science/api/pith-number/UWZZPFTSVBSD2WKVIB6QZLVV22/graph.json","fetch_events":"https://pith.science/api/pith-number/UWZZPFTSVBSD2WKVIB6QZLVV22/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWZZPFTSVBSD2WKVIB6QZLVV22/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWZZPFTSVBSD2WKVIB6QZLVV22/action/storage_attestation","attest_author":"https://pith.science/pith/UWZZPFTSVBSD2WKVIB6QZLVV22/action/author_attestation","sign_citation":"https://pith.science/pith/UWZZPFTSVBSD2WKVIB6QZLVV22/action/citation_signature","submit_replication":"https://pith.science/pith/UWZZPFTSVBSD2WKVIB6QZLVV22/action/replication_record"}},"created_at":"2026-07-05T00:57:37.063773+00:00","updated_at":"2026-07-05T00:57:37.063773+00:00"}