{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WRHUFUWB2Q4IG67EYSYAISPGGY","short_pith_number":"pith:WRHUFUWB","schema_version":"1.0","canonical_sha256":"b44f42d2c1d438837be4c4b00449e6363c3c32067c34d14f50a0ce5b2a2b3ddf","source":{"kind":"arxiv","id":"2608.04058","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.04058","created_at":"2026-08-06T01:28:13.948470+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.04058v1","created_at":"2026-08-06T01:28:13.948470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04058","created_at":"2026-08-06T01:28:13.948470+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRHUFUWB2Q4I","created_at":"2026-08-06T01:28:13.948470+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRHUFUWB2Q4IG67E","created_at":"2026-08-06T01:28:13.948470+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRHUFUWB","created_at":"2026-08-06T01:28:13.948470+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/WRHUFUWB2Q4IG67EYSYAISPGGY","json":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY.json","graph_json":"https://pith.science/api/pith-number/WRHUFUWB2Q4IG67EYSYAISPGGY/graph.json","events_json":"https://pith.science/api/pith-number/WRHUFUWB2Q4IG67EYSYAISPGGY/events.json","paper":"https://pith.science/paper/WRHUFUWB"},"agent_actions":{"view_html":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY","download_json":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY.json","view_paper":"https://pith.science/paper/WRHUFUWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.04058&json=true","fetch_graph":"https://pith.science/api/pith-number/WRHUFUWB2Q4IG67EYSYAISPGGY/graph.json","fetch_events":"https://pith.science/api/pith-number/WRHUFUWB2Q4IG67EYSYAISPGGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY/action/storage_attestation","attest_author":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY/action/author_attestation","sign_citation":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY/action/citation_signature","submit_replication":"https://pith.science/pith/WRHUFUWB2Q4IG67EYSYAISPGGY/action/replication_record"}},"created_at":"2026-08-06T01:28:13.948470+00:00","updated_at":"2026-08-06T01:28:13.948470+00:00"}