{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2N2L5B43WA5Y2TJUMOPEGMMR2R","short_pith_number":"pith:2N2L5B43","schema_version":"1.0","canonical_sha256":"d374be879bb03b8d4d34639e433191d448f30d92c91893854052905c2e17846b","source":{"kind":"arxiv","id":"1001.0674","version":2},"attestation_state":"computed","paper":{"title":"The 3-dimensional cube is the only periodic, connected cubic graph with perfect state transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Simone Severini","submitted_at":"2010-01-05T18:12:53Z","abstract_excerpt":"There is perfect state transfer between two vertices of a graph, if a single excitation can travel with fidelity one between the corresponding sites of a spin system modeled by the graph. When the excitation is back at the initial site, for all sites at the same time, the graph is said to be periodic. A graph is cubic if each of its vertices has a neighbourhood of size exactly three. We prove that the 3-dimensional cube is the only periodic, connected cubic graph with perfect state transfer. We conjecture that this is also the only connected cubic graph with perfect state transfer."},"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":"1001.0674","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-01-05T18:12:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b7df98b8e557da972b64a7ed098eaa03cc66d47922fa63846ec30b82b2e85155","abstract_canon_sha256":"751693384da72a06c4783cb3ded887a003c81eb28bec5f1dae11b872ebc27044"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:02.448724Z","signature_b64":"rqS4FA+ailO/ktbWme7iL3UN6tAUJMGBNkNWCiiciAWl8+skY4Tu8X0ARk9hlPErxD5glmCZ04F4Z2OV+LFxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d374be879bb03b8d4d34639e433191d448f30d92c91893854052905c2e17846b","last_reissued_at":"2026-05-18T04:12:02.448310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:02.448310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The 3-dimensional cube is the only periodic, connected cubic graph with perfect state transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Simone Severini","submitted_at":"2010-01-05T18:12:53Z","abstract_excerpt":"There is perfect state transfer between two vertices of a graph, if a single excitation can travel with fidelity one between the corresponding sites of a spin system modeled by the graph. When the excitation is back at the initial site, for all sites at the same time, the graph is said to be periodic. A graph is cubic if each of its vertices has a neighbourhood of size exactly three. We prove that the 3-dimensional cube is the only periodic, connected cubic graph with perfect state transfer. We conjecture that this is also the only connected cubic graph with perfect state transfer."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0674","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1001.0674","created_at":"2026-05-18T04:12:02.448376+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.0674v2","created_at":"2026-05-18T04:12:02.448376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0674","created_at":"2026-05-18T04:12:02.448376+00:00"},{"alias_kind":"pith_short_12","alias_value":"2N2L5B43WA5Y","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2N2L5B43WA5Y2TJU","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2N2L5B43","created_at":"2026-05-18T12:26:03.138858+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/2N2L5B43WA5Y2TJUMOPEGMMR2R","json":"https://pith.science/pith/2N2L5B43WA5Y2TJUMOPEGMMR2R.json","graph_json":"https://pith.science/api/pith-number/2N2L5B43WA5Y2TJUMOPEGMMR2R/graph.json","events_json":"https://pith.science/api/pith-number/2N2L5B43WA5Y2TJUMOPEGMMR2R/events.json","paper":"https://pith.science/paper/2N2L5B43"},"agent_actions":{"view_html":"https://pith.science/pith/2N2L5B43WA5Y2TJUMOPEGMMR2R","download_json":"https://pith.science/pith/2N2L5B43WA5Y2TJUMOPEGMMR2R.json","view_paper":"https://pith.science/paper/2N2L5B43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.0674&json=true","fetch_graph":"https://pith.science/api/pith-number/2N2L5B43WA5Y2TJUMOPEGMMR2R/graph.json","fetch_events":"https://pith.science/api/pith-number/2N2L5B43WA5Y2TJUMOPEGMMR2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2N2L5B43WA5Y2TJUMOPEGMMR2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2N2L5B43WA5Y2TJUMOPEGMMR2R/action/storage_attestation","attest_author":"https://pith.science/pith/2N2L5B43WA5Y2TJUMOPEGMMR2R/action/author_attestation","sign_citation":"https://pith.science/pith/2N2L5B43WA5Y2TJUMOPEGMMR2R/action/citation_signature","submit_replication":"https://pith.science/pith/2N2L5B43WA5Y2TJUMOPEGMMR2R/action/replication_record"}},"created_at":"2026-05-18T04:12:02.448376+00:00","updated_at":"2026-05-18T04:12:02.448376+00:00"}