{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KCVP2I4IMW73JPMHX7H3CEYDGQ","short_pith_number":"pith:KCVP2I4I","schema_version":"1.0","canonical_sha256":"50aafd238865bfb4bd87bfcfb11303341e5bed9a6d75be75582879255dac0c70","source":{"kind":"arxiv","id":"1010.4721","version":2},"attestation_state":"computed","paper":{"title":"Perfect state transfer in cubelike graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Chris Godsil, Wang-Chi Cheung","submitted_at":"2010-10-22T14:22:52Z","abstract_excerpt":"Suppose $C$ is a subset of non-zero vectors from the vector space $\\mathbb{Z}_2^d$. The cubelike graph $X(C)$ has $\\mathbb{Z}_2^d$ as its vertex set, and two elements of $\\mathbb{Z}_2^d$ are adjacent if their difference is in $C$. If $M$ is the $d\\times |C|$ matrix with the elements of $C$ as its columns, we call the row space of $M$ the code of $X$. We use this code to study perfect state transfer on cubelike graphs. Bernasconi et al have shown that perfect state transfer occurs on $X(C)$ at time $\\pi/2$ if and only if the sum of the elements of $C$ is not zero. Here we consider what happens "},"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":"1010.4721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-22T14:22:52Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"20c214153e3e7a8c3146d57dd17007d20a9df0eed826e415de01ca14bb1def89","abstract_canon_sha256":"aa5d78f3e8a011e3b3ba7ee1e7d2f92fc41a2d2f564ddeb52b4c4ac8ba9daca4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:12.294132Z","signature_b64":"16VxnoY7GXAeMoAQMR+5DHKE2uO9fxmta6qCKwpEyIZm0wf7RZfZ4Ak/qR8b223ETjtFA60/SPOjQ2TfUnJgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50aafd238865bfb4bd87bfcfb11303341e5bed9a6d75be75582879255dac0c70","last_reissued_at":"2026-05-18T04:19:12.293675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:12.293675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect state transfer in cubelike graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Chris Godsil, Wang-Chi Cheung","submitted_at":"2010-10-22T14:22:52Z","abstract_excerpt":"Suppose $C$ is a subset of non-zero vectors from the vector space $\\mathbb{Z}_2^d$. The cubelike graph $X(C)$ has $\\mathbb{Z}_2^d$ as its vertex set, and two elements of $\\mathbb{Z}_2^d$ are adjacent if their difference is in $C$. If $M$ is the $d\\times |C|$ matrix with the elements of $C$ as its columns, we call the row space of $M$ the code of $X$. We use this code to study perfect state transfer on cubelike graphs. Bernasconi et al have shown that perfect state transfer occurs on $X(C)$ at time $\\pi/2$ if and only if the sum of the elements of $C$ is not zero. Here we consider what happens "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4721","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":"1010.4721","created_at":"2026-05-18T04:19:12.293745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.4721v2","created_at":"2026-05-18T04:19:12.293745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4721","created_at":"2026-05-18T04:19:12.293745+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCVP2I4IMW73","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCVP2I4IMW73JPMH","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCVP2I4I","created_at":"2026-05-18T12:26:09.077623+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/KCVP2I4IMW73JPMHX7H3CEYDGQ","json":"https://pith.science/pith/KCVP2I4IMW73JPMHX7H3CEYDGQ.json","graph_json":"https://pith.science/api/pith-number/KCVP2I4IMW73JPMHX7H3CEYDGQ/graph.json","events_json":"https://pith.science/api/pith-number/KCVP2I4IMW73JPMHX7H3CEYDGQ/events.json","paper":"https://pith.science/paper/KCVP2I4I"},"agent_actions":{"view_html":"https://pith.science/pith/KCVP2I4IMW73JPMHX7H3CEYDGQ","download_json":"https://pith.science/pith/KCVP2I4IMW73JPMHX7H3CEYDGQ.json","view_paper":"https://pith.science/paper/KCVP2I4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.4721&json=true","fetch_graph":"https://pith.science/api/pith-number/KCVP2I4IMW73JPMHX7H3CEYDGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/KCVP2I4IMW73JPMHX7H3CEYDGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCVP2I4IMW73JPMHX7H3CEYDGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCVP2I4IMW73JPMHX7H3CEYDGQ/action/storage_attestation","attest_author":"https://pith.science/pith/KCVP2I4IMW73JPMHX7H3CEYDGQ/action/author_attestation","sign_citation":"https://pith.science/pith/KCVP2I4IMW73JPMHX7H3CEYDGQ/action/citation_signature","submit_replication":"https://pith.science/pith/KCVP2I4IMW73JPMHX7H3CEYDGQ/action/replication_record"}},"created_at":"2026-05-18T04:19:12.293745+00:00","updated_at":"2026-05-18T04:19:12.293745+00:00"}