{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XMUF66HUWNH5GP3VUM6XKPJAF5","short_pith_number":"pith:XMUF66HU","schema_version":"1.0","canonical_sha256":"bb285f78f4b34fd33f75a33d753d202f64860c7bbc4986f07c4e113662deceb6","source":{"kind":"arxiv","id":"2403.04126","version":2},"attestation_state":"computed","paper":{"title":"Optimal Scheduling of Graph States via Path Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Jason Gavriel, Ryan L. Mann, Samuel J. Elman","submitted_at":"2024-03-07T00:50:02Z","abstract_excerpt":"We study the optimal scheduling of graph states in measurement-based quantum computation, establishing an equivalence between measurement schedules and path decompositions of graphs. We define the spatial cost of a measurement schedule based on the number of simultaneously active qubits and prove that an optimal measurement schedule corresponds to a path decomposition of minimal width. Our analysis shows that approximating the spatial cost of a graph is $\\textsf{NP}$-hard, while for graphs with bounded spatial cost, we establish an efficient algorithm for computing an optimal measurement sched"},"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":"2403.04126","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-07T00:50:02Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"cb0dc1e70c8f22203c0299409060e30fbae66b4f585c0b86768c2f76608b39e4","abstract_canon_sha256":"6b30cb9e0f7e447d4e9d86bfc23a4ae9beda43b2d7e668f979c32d173173f0a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:06:03.249829Z","signature_b64":"M4H49rkaNHE8IMx8SnuzvrwERHZ+DHTJwe+lAdnI3QfJVMdO+Pyu2VaH5p+npgV2hGHJSTYk6YM6ykztPFwUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb285f78f4b34fd33f75a33d753d202f64860c7bbc4986f07c4e113662deceb6","last_reissued_at":"2026-07-05T10:06:03.248127Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:06:03.248127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Scheduling of Graph States via Path Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Jason Gavriel, Ryan L. Mann, Samuel J. Elman","submitted_at":"2024-03-07T00:50:02Z","abstract_excerpt":"We study the optimal scheduling of graph states in measurement-based quantum computation, establishing an equivalence between measurement schedules and path decompositions of graphs. We define the spatial cost of a measurement schedule based on the number of simultaneously active qubits and prove that an optimal measurement schedule corresponds to a path decomposition of minimal width. Our analysis shows that approximating the spatial cost of a graph is $\\textsf{NP}$-hard, while for graphs with bounded spatial cost, we establish an efficient algorithm for computing an optimal measurement sched"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.04126","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.04126/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":"2403.04126","created_at":"2026-07-05T10:06:03.248183+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.04126v2","created_at":"2026-07-05T10:06:03.248183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.04126","created_at":"2026-07-05T10:06:03.248183+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMUF66HUWNH5","created_at":"2026-07-05T10:06:03.248183+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMUF66HUWNH5GP3V","created_at":"2026-07-05T10:06:03.248183+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMUF66HU","created_at":"2026-07-05T10:06:03.248183+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/XMUF66HUWNH5GP3VUM6XKPJAF5","json":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5.json","graph_json":"https://pith.science/api/pith-number/XMUF66HUWNH5GP3VUM6XKPJAF5/graph.json","events_json":"https://pith.science/api/pith-number/XMUF66HUWNH5GP3VUM6XKPJAF5/events.json","paper":"https://pith.science/paper/XMUF66HU"},"agent_actions":{"view_html":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5","download_json":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5.json","view_paper":"https://pith.science/paper/XMUF66HU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.04126&json=true","fetch_graph":"https://pith.science/api/pith-number/XMUF66HUWNH5GP3VUM6XKPJAF5/graph.json","fetch_events":"https://pith.science/api/pith-number/XMUF66HUWNH5GP3VUM6XKPJAF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5/action/storage_attestation","attest_author":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5/action/author_attestation","sign_citation":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5/action/citation_signature","submit_replication":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5/action/replication_record"}},"created_at":"2026-07-05T10:06:03.248183+00:00","updated_at":"2026-07-05T10:06:03.248183+00:00"}