{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XMUF66HUWNH5GP3VUM6XKPJAF5","short_pith_number":"pith:XMUF66HU","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"},"canonical_sha256":"bb285f78f4b34fd33f75a33d753d202f64860c7bbc4986f07c4e113662deceb6","source":{"kind":"arxiv","id":"2403.04126","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.04126","created_at":"2026-07-05T10:06:03Z"},{"alias_kind":"arxiv_version","alias_value":"2403.04126v2","created_at":"2026-07-05T10:06:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.04126","created_at":"2026-07-05T10:06:03Z"},{"alias_kind":"pith_short_12","alias_value":"XMUF66HUWNH5","created_at":"2026-07-05T10:06:03Z"},{"alias_kind":"pith_short_16","alias_value":"XMUF66HUWNH5GP3V","created_at":"2026-07-05T10:06:03Z"},{"alias_kind":"pith_short_8","alias_value":"XMUF66HU","created_at":"2026-07-05T10:06:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XMUF66HUWNH5GP3VUM6XKPJAF5","target":"record","payload":{"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"},"canonical_sha256":"bb285f78f4b34fd33f75a33d753d202f64860c7bbc4986f07c4e113662deceb6","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"},"source_kind":"arxiv","source_id":"2403.04126","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:06:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B5vtPzFv6RCL4yaryii9wxZNW2FQQJ50ge9Zs09gcbQAATJSLsBO3I6ALz80RUj0vgbZbpk1qcVMsq5Iio4ODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:52:01.465910Z"},"content_sha256":"f860560275f458942bb2429056bfa7c28f915e9ca57ab100cfd77e23492cfbc9","schema_version":"1.0","event_id":"sha256:f860560275f458942bb2429056bfa7c28f915e9ca57ab100cfd77e23492cfbc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XMUF66HUWNH5GP3VUM6XKPJAF5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:06:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XnMscvvhKJKNUrLm+ioYAkR2RE8cI36wwQCyCweR238c1aevnjAUvoXMIt7/YAdj9CK8gQ+oIZmOmWtZplMcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:52:01.466309Z"},"content_sha256":"4baa8ef90bb819bc07c57ce2e3cfd984f61dd2d386f26b5df90250c4063c0488","schema_version":"1.0","event_id":"sha256:4baa8ef90bb819bc07c57ce2e3cfd984f61dd2d386f26b5df90250c4063c0488"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5/bundle.json","state_url":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMUF66HUWNH5GP3VUM6XKPJAF5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T09:52:01Z","links":{"resolver":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5","bundle":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5/bundle.json","state":"https://pith.science/pith/XMUF66HUWNH5GP3VUM6XKPJAF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMUF66HUWNH5GP3VUM6XKPJAF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XMUF66HUWNH5GP3VUM6XKPJAF5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6b30cb9e0f7e447d4e9d86bfc23a4ae9beda43b2d7e668f979c32d173173f0a9","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-07T00:50:02Z","title_canon_sha256":"cb0dc1e70c8f22203c0299409060e30fbae66b4f585c0b86768c2f76608b39e4"},"schema_version":"1.0","source":{"id":"2403.04126","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.04126","created_at":"2026-07-05T10:06:03Z"},{"alias_kind":"arxiv_version","alias_value":"2403.04126v2","created_at":"2026-07-05T10:06:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.04126","created_at":"2026-07-05T10:06:03Z"},{"alias_kind":"pith_short_12","alias_value":"XMUF66HUWNH5","created_at":"2026-07-05T10:06:03Z"},{"alias_kind":"pith_short_16","alias_value":"XMUF66HUWNH5GP3V","created_at":"2026-07-05T10:06:03Z"},{"alias_kind":"pith_short_8","alias_value":"XMUF66HU","created_at":"2026-07-05T10:06:03Z"}],"graph_snapshots":[{"event_id":"sha256:4baa8ef90bb819bc07c57ce2e3cfd984f61dd2d386f26b5df90250c4063c0488","target":"graph","created_at":"2026-07-05T10:06:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.04126/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jason Gavriel, Ryan L. Mann, Samuel J. Elman","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-07T00:50:02Z","title":"Optimal Scheduling of Graph States via Path Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.04126","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f860560275f458942bb2429056bfa7c28f915e9ca57ab100cfd77e23492cfbc9","target":"record","created_at":"2026-07-05T10:06:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6b30cb9e0f7e447d4e9d86bfc23a4ae9beda43b2d7e668f979c32d173173f0a9","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-07T00:50:02Z","title_canon_sha256":"cb0dc1e70c8f22203c0299409060e30fbae66b4f585c0b86768c2f76608b39e4"},"schema_version":"1.0","source":{"id":"2403.04126","kind":"arxiv","version":2}},"canonical_sha256":"bb285f78f4b34fd33f75a33d753d202f64860c7bbc4986f07c4e113662deceb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb285f78f4b34fd33f75a33d753d202f64860c7bbc4986f07c4e113662deceb6","first_computed_at":"2026-07-05T10:06:03.248127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:06:03.248127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M4H49rkaNHE8IMx8SnuzvrwERHZ+DHTJwe+lAdnI3QfJVMdO+Pyu2VaH5p+npgV2hGHJSTYk6YM6ykztPFwUAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:06:03.249829Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.04126","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f860560275f458942bb2429056bfa7c28f915e9ca57ab100cfd77e23492cfbc9","sha256:4baa8ef90bb819bc07c57ce2e3cfd984f61dd2d386f26b5df90250c4063c0488"],"state_sha256":"bae60d9c927af590ac0d5210b52da4373407ee9125a13cafc791489e970e3058"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u78mIN3jk7mY11vDpZzwuvikycbGTBHgS1QAVomMpEFp7z9mfyqRty/WRHdKf2Kg/JKGsZ2wii5256OD+myUBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T09:52:01.470627Z","bundle_sha256":"ab9eb64f7e08b0a05acfb7920d4d2d66ac933db35f0362b1922df7e566033f3d"}}