{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WRHUFUWB2Q4IG67EYSYAISPGGY","short_pith_number":"pith:WRHUFUWB","canonical_record":{"source":{"id":"2608.04058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T12:36:54Z","cross_cats_sorted":[],"title_canon_sha256":"91a2cdd9b257fe0d18a414e6514bb647b986c538a0be66184dd17f3f65bc5872","abstract_canon_sha256":"106875ce26c33f9d1a9f6a027ed0b08187d09770e092fd171eb7d1ab08d43724"},"schema_version":"1.0"},"canonical_sha256":"b44f42d2c1d438837be4c4b00449e6363c3c32067c34d14f50a0ce5b2a2b3ddf","source":{"kind":"arxiv","id":"2608.04058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04058","created_at":"2026-08-06T01:28:13Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04058v1","created_at":"2026-08-06T01:28:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04058","created_at":"2026-08-06T01:28:13Z"},{"alias_kind":"pith_short_12","alias_value":"WRHUFUWB2Q4I","created_at":"2026-08-06T01:28:13Z"},{"alias_kind":"pith_short_16","alias_value":"WRHUFUWB2Q4IG67E","created_at":"2026-08-06T01:28:13Z"},{"alias_kind":"pith_short_8","alias_value":"WRHUFUWB","created_at":"2026-08-06T01:28:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WRHUFUWB2Q4IG67EYSYAISPGGY","target":"record","payload":{"canonical_record":{"source":{"id":"2608.04058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T12:36:54Z","cross_cats_sorted":[],"title_canon_sha256":"91a2cdd9b257fe0d18a414e6514bb647b986c538a0be66184dd17f3f65bc5872","abstract_canon_sha256":"106875ce26c33f9d1a9f6a027ed0b08187d09770e092fd171eb7d1ab08d43724"},"schema_version":"1.0"},"canonical_sha256":"b44f42d2c1d438837be4c4b00449e6363c3c32067c34d14f50a0ce5b2a2b3ddf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:28:13.948143Z","signature_b64":"EbvT3CVPUm17g1uSrcj9bC3U2GLSefaG2WgMvz4OQzI3g/Yfea+3PV6TBQxFTbeuFbm2vqwc2dCuMgRArvmcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b44f42d2c1d438837be4c4b00449e6363c3c32067c34d14f50a0ce5b2a2b3ddf","last_reissued_at":"2026-08-06T01:28:13.946687Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:28:13.946687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.04058","source_version":1,"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-08-06T01:28:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RigubUf/1SsykGHD7MpVTmcCtbMpjLQN90eSDnJjqVBPig9vT2tvRGAmPYVYfA4DIce2Twa6mGGlfruFI4oFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:04:16.035288Z"},"content_sha256":"c83a7cdeeabfd82e07cc69231dc109620699f5a99c90ad03ce2f0e0f0c8b1756","schema_version":"1.0","event_id":"sha256:c83a7cdeeabfd82e07cc69231dc109620699f5a99c90ad03ce2f0e0f0c8b1756"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WRHUFUWB2Q4IG67EYSYAISPGGY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-Aware Exact Branch-and-Bound with Device Profiles for Static Qubit Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kamer Kaya","submitted_at":"2026-08-04T12:36:54Z","abstract_excerpt":"Static qubit allocation maps a circuit's logical qubits to a sparse physical device while minimising an interaction-weighted physical-distance cost function, yielding a rectangular quadratic assignment problem. Existing work combines strong lower bounds with distributed branch-and-bound. We integrate graph-aware exact reductions with an engineering bundle for a lightweight assignment-bound path: unavoidable assigned-cost filtering, incrementally maintained root-orbit and prefix-stabilizer symmetry pruning, conditioned parent-LAP screening, and circuit-independent physical device profiles. On 2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04058","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/2608.04058/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-08-06T01:28:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JUf4vi0q+8nb2CjX/oZ7QQMJqwpmeVqP+OELGmMiUSg2b1cgwp/zWDU85VVXtRblqyTXWFNcguf5n16TS5pwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:04:16.035683Z"},"content_sha256":"dc0afbb73170b0d8798f7d0cf6e99b0a4b2021072cf8ea5c342d9d37d278cda6","schema_version":"1.0","event_id":"sha256:dc0afbb73170b0d8798f7d0cf6e99b0a4b2021072cf8ea5c342d9d37d278cda6"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:WRHUFUWB2Q4IG67EYSYAISPGGY","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.ejor.2005.09.032 resolves to 'A survey for the quadratic assignment problem'. A reader following the printed text alone cannot reach it.","snippet":"E. M. Loiola, N. M. M. de Abreu, P. O. Boaventura-Netto, P. Hahn, T. Querido, A survey for the quadratic assign- ment problem, European Journal of Operational Research 176 (2) (2007) 657–690. doi:10.1016/j.ejor.2005. 09.032","arxiv_id":"2608.04058","detector":"doi_compliance","evidence":{"ref_index":22,"verdict_class":"incontrovertible","resolved_title":"A survey for the quadratic assignment problem","printed_excerpt":"10.1016/j.ejor.2005","reconstructed_doi":"10.1016/j.ejor.2005.09.032"},"severity":"advisory","ref_index":22,"audited_at":"2026-08-08T00:58:28.950789Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.ejor.2005.09.032","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"90b6f517cc2c3743a7b5e582642b8e438aa774492cae9f6bac9f5328d5b49041","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"A survey for the quadratic assignment problem","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18606,"payload_sha256":"6c71d02bd71388994988cd1666959a35eca91c742e3b1a2effb29c7e5bd3704e","signature_b64":"ToHvwEqK6WV1icl6YcdgPXzC8yE3Y8yEfQWO1MRhjLDImfkrhXdcpQxXXt5wokxGtwEaOWMkwuHV7TcaiTPdDg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-08T00:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4TGqWmIM1YaIgWSQ0SFVZkUruap+lAFfx03UvOvRc/n+WX7ZO8StPUl01Fb+kiLXMOUJqb4X8Q1yXR3cRzkIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:04:16.044143Z"},"content_sha256":"3983c1f2dc7a522efcaa20c5adef56f04fefd8182f8c6679bb7114e7fa5f7e4f","schema_version":"1.0","event_id":"sha256:3983c1f2dc7a522efcaa20c5adef56f04fefd8182f8c6679bb7114e7fa5f7e4f"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:WRHUFUWB2Q4IG67EYSYAISPGGY","target":"integrity","payload":{"note":"Identifier '10.1016/0166-218x(87' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"C. R. Chegireddy, H. W. Hamacher, Algorithms for finding k-best perfect matchings, Discrete Applied Mathematics 18 (2) (1987) 155–165. doi:10.1016/0166-218X(87) 90017-5. 14","arxiv_id":"2608.04058","detector":"doi_compliance","evidence":{"doi":"10.1016/0166-218x(87","arxiv_id":null,"ref_index":16,"raw_excerpt":"C. R. Chegireddy, H. W. Hamacher, Algorithms for finding k-best perfect matchings, Discrete Applied Mathematics 18 (2) (1987) 155–165. doi:10.1016/0166-218X(87) 90017-5. 14","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":16,"audited_at":"2026-08-08T00:58:28.950789Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0166-218x(87","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"8b9acbd704e024066e021b3079d6f1592147e6a48acf8e0ce0fb560e470ce699","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18605,"payload_sha256":"6899da9c337d5d5f0dcba2d400df86b5acb830cc2b866de4af92bcbc3609f1f5","signature_b64":"WOxeuAIHavd1yIS9BSUlct23vvcnNWNlhhJsuRLssU5KYfSlKj9z+DS4UFMUQzyxBe2xCSDwvgPIURBB89OoAw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-08T00:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6h0anUMO18uwZRgkmL6nx051Tbkuo/eZ1vRvdtV7LatBEYDgA4nWDKEb/w4AHOtsWxhMhuMZx4gog3vv/mmbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:04:16.044453Z"},"content_sha256":"7e2e9fb63cd365be150d39c7d1ce03b6f35c67f1138a493f87bcdeb35971458b","schema_version":"1.0","event_id":"sha256:7e2e9fb63cd365be150d39c7d1ce03b6f35c67f1138a493f87bcdeb35971458b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:WRHUFUWB2Q4IG67EYSYAISPGGY","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1287/mnsc.9.4.586 resolves to 'The Quadratic Assignment Problem'. A reader following the printed text alone cannot reach it.","snippet":"E. L. Lawler, The quadratic assignment problem, Manage- ment Science 9 (4) (1963) 586–599. doi:10.1287/mnsc. 9.4.586","arxiv_id":"2608.04058","detector":"doi_compliance","evidence":{"ref_index":9,"verdict_class":"incontrovertible","resolved_title":"The Quadratic Assignment Problem","printed_excerpt":"10.1287/mnsc","reconstructed_doi":"10.1287/mnsc.9.4.586"},"severity":"advisory","ref_index":9,"audited_at":"2026-08-08T00:58:28.950789Z","event_type":"pith.integrity.v1","detected_doi":"10.1287/mnsc.9.4.586","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"8d9266ea5aa0b548e6c5354328d87e6d0f0ec079413dbffcdead62a695e3680a","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"The Quadratic Assignment Problem","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18604,"payload_sha256":"1d0933640d2da74c436cfe7a9dd80511402860851f79c9bb291ebad370c0a11a","signature_b64":"5I1owixM2yj7mjwS0zYn3RY8RxkB1NQ6Xrnl7Lp9XU/xqpgUXt2zmEvOFNnxltFHYTViLic4SgumfnKDJO73BA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-08T00:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZMEdRothLhXAipZMTyUDpuqO+vi3UIlielLq1Bo6NRW+cJWrmvQTHJKxOHhc/n2xnUTibsPp6APbvRdYvnUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:04:16.044759Z"},"content_sha256":"d9244439811d9276b50693dcb2b35c126e8b6c19e717375eefc63593314d23ac","schema_version":"1.0","event_id":"sha256:d9244439811d9276b50693dcb2b35c126e8b6c19e717375eefc63593314d23ac"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:WRHUFUWB2Q4IG67EYSYAISPGGY","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1287/opre.46.6.912 resolves to 'Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation'. A reader following the printed text alone cannot reach it.","snippet":"P. Hahn, T. Grant, Lower bounds for the quadratic assign- ment problem based upon a dual formulation, Operations Research 46 (6) (1998) 912–922. doi:10.1287/opre. 46.6.912","arxiv_id":"2608.04058","detector":"doi_compliance","evidence":{"ref_index":1,"verdict_class":"incontrovertible","resolved_title":"Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation","printed_excerpt":"10.1287/opre","reconstructed_doi":"10.1287/opre.46.6.912"},"severity":"advisory","ref_index":1,"audited_at":"2026-08-08T00:58:28.950789Z","event_type":"pith.integrity.v1","detected_doi":"10.1287/opre.46.6.912","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"fd448a13fd0950b812bced25585d84395b7f9fabbeaf0e5c91fff6e97fc1a5d7","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18603,"payload_sha256":"940424f1c98b97fa679ae6338944c78f1ef1e73675a7078dddbedd81c1bf26cb","signature_b64":"nlfuW64b+oGZFKEaPZ1wMFSPormdyKqiIxDIfVOx3b3dJ//gsh2GwakdbzqnzvcZ3V0xhxHw0G0F9/QOOrgxAg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-08T00:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/iHZFbCL3eadH9pHnAi3I/Rt0X6d6HrcykiQi1ZmdebfINsjg/I/PDJPTFt7XSaNFWhfP9sUgOYvFTYeY+gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:04:16.045054Z"},"content_sha256":"372f453c389186e7d8d9164e36c9d7abdbb0e5f5d46f43915e0f82abff0fd21d","schema_version":"1.0","event_id":"sha256:372f453c389186e7d8d9164e36c9d7abdbb0e5f5d46f43915e0f82abff0fd21d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY/bundle.json","state_url":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRHUFUWB2Q4IG67EYSYAISPGGY/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-13T12:04:16Z","links":{"resolver":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY","bundle":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY/bundle.json","state":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRHUFUWB2Q4IG67EYSYAISPGGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WRHUFUWB2Q4IG67EYSYAISPGGY","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"106875ce26c33f9d1a9f6a027ed0b08187d09770e092fd171eb7d1ab08d43724","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T12:36:54Z","title_canon_sha256":"91a2cdd9b257fe0d18a414e6514bb647b986c538a0be66184dd17f3f65bc5872"},"schema_version":"1.0","source":{"id":"2608.04058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04058","created_at":"2026-08-06T01:28:13Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04058v1","created_at":"2026-08-06T01:28:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04058","created_at":"2026-08-06T01:28:13Z"},{"alias_kind":"pith_short_12","alias_value":"WRHUFUWB2Q4I","created_at":"2026-08-06T01:28:13Z"},{"alias_kind":"pith_short_16","alias_value":"WRHUFUWB2Q4IG67E","created_at":"2026-08-06T01:28:13Z"},{"alias_kind":"pith_short_8","alias_value":"WRHUFUWB","created_at":"2026-08-06T01:28:13Z"}],"graph_snapshots":[{"event_id":"sha256:dc0afbb73170b0d8798f7d0cf6e99b0a4b2021072cf8ea5c342d9d37d278cda6","target":"graph","created_at":"2026-08-06T01:28:13Z","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/2608.04058/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Static qubit allocation maps a circuit's logical qubits to a sparse physical device while minimising an interaction-weighted physical-distance cost function, yielding a rectangular quadratic assignment problem. Existing work combines strong lower bounds with distributed branch-and-bound. We integrate graph-aware exact reductions with an engineering bundle for a lightweight assignment-bound path: unavoidable assigned-cost filtering, incrementally maintained root-orbit and prefix-stabilizer symmetry pruning, conditioned parent-LAP screening, and circuit-independent physical device profiles. On 2","authors_text":"Kamer Kaya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T12:36:54Z","title":"Graph-Aware Exact Branch-and-Bound with Device Profiles for Static Qubit Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04058","kind":"arxiv","version":1},"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:c83a7cdeeabfd82e07cc69231dc109620699f5a99c90ad03ce2f0e0f0c8b1756","target":"record","created_at":"2026-08-06T01:28:13Z","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":"106875ce26c33f9d1a9f6a027ed0b08187d09770e092fd171eb7d1ab08d43724","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T12:36:54Z","title_canon_sha256":"91a2cdd9b257fe0d18a414e6514bb647b986c538a0be66184dd17f3f65bc5872"},"schema_version":"1.0","source":{"id":"2608.04058","kind":"arxiv","version":1}},"canonical_sha256":"b44f42d2c1d438837be4c4b00449e6363c3c32067c34d14f50a0ce5b2a2b3ddf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b44f42d2c1d438837be4c4b00449e6363c3c32067c34d14f50a0ce5b2a2b3ddf","first_computed_at":"2026-08-06T01:28:13.946687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-06T01:28:13.946687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EbvT3CVPUm17g1uSrcj9bC3U2GLSefaG2WgMvz4OQzI3g/Yfea+3PV6TBQxFTbeuFbm2vqwc2dCuMgRArvmcCQ==","signature_status":"signed_v1","signed_at":"2026-08-06T01:28:13.948143Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.04058","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:372f453c389186e7d8d9164e36c9d7abdbb0e5f5d46f43915e0f82abff0fd21d","sha256:3983c1f2dc7a522efcaa20c5adef56f04fefd8182f8c6679bb7114e7fa5f7e4f","sha256:7e2e9fb63cd365be150d39c7d1ce03b6f35c67f1138a493f87bcdeb35971458b","sha256:d9244439811d9276b50693dcb2b35c126e8b6c19e717375eefc63593314d23ac"]}],"invalid_events":[],"applied_event_ids":["sha256:c83a7cdeeabfd82e07cc69231dc109620699f5a99c90ad03ce2f0e0f0c8b1756","sha256:dc0afbb73170b0d8798f7d0cf6e99b0a4b2021072cf8ea5c342d9d37d278cda6"],"state_sha256":"78b5a8c8c27e72b9ee1b19e24719bd2e78631ea2bbe9c632a7f400082114d078"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fJ4w/JBw3t8ovB+C58C9DXdj7xqHbizfsqLJ9W0ywEOYPGu17+/HSKYXum5dkqVaNV0BwQlZiQQtyr0IkCbDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T12:04:16.047338Z","bundle_sha256":"cca5d1eaec85be9e2fe9378a085048b24934190764418087af786b38cd61cfa9"}}