{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NR4W66GYAWA7OKEXOW6O7ZFAHZ","short_pith_number":"pith:NR4W66GY","canonical_record":{"source":{"id":"2605.12583","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T17:12:30Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"bc79d29d4a1856421c3c9b8b63b67196e135910188f63895dd17294c71faaa1b","abstract_canon_sha256":"e1cf8662dee6575ea4010ff3dc33993a58788150919679cfdf48db9c0b6675e1"},"schema_version":"1.0"},"canonical_sha256":"6c796f78d80581f7289775bcefe4a03e626b26041fb350780257a9dac5baa749","source":{"kind":"arxiv","id":"2605.12583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12583","created_at":"2026-05-18T03:10:01Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12583v1","created_at":"2026-05-18T03:10:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12583","created_at":"2026-05-18T03:10:01Z"},{"alias_kind":"pith_short_12","alias_value":"NR4W66GYAWA7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"NR4W66GYAWA7OKEX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"NR4W66GY","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NR4W66GYAWA7OKEXOW6O7ZFAHZ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12583","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T17:12:30Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"bc79d29d4a1856421c3c9b8b63b67196e135910188f63895dd17294c71faaa1b","abstract_canon_sha256":"e1cf8662dee6575ea4010ff3dc33993a58788150919679cfdf48db9c0b6675e1"},"schema_version":"1.0"},"canonical_sha256":"6c796f78d80581f7289775bcefe4a03e626b26041fb350780257a9dac5baa749","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:01.409966Z","signature_b64":"ZnP67n5HXvysdTf1mio7Nv4FxZhEkZE4lBNGNuvLG2rzP0OVISrAJpWvvEkcNAZIkbp9l46AlmtZZjdJPft3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c796f78d80581f7289775bcefe4a03e626b26041fb350780257a9dac5baa749","last_reissued_at":"2026-05-18T03:10:01.408845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:01.408845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12583","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-05-18T03:10:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfHMvdC+p2gZnrDpdJJYNk7T7wMz0EaAgqJrshK3OaAQvYaWjtIo9qTRlBvORML3f6/qYB7fo1jSV9Wmlo3wAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:23:47.554612Z"},"content_sha256":"e17c3e381741b90fc8cc0274a3a9ccbffe48c47f78696be811ea670fc98c15bb","schema_version":"1.0","event_id":"sha256:e17c3e381741b90fc8cc0274a3a9ccbffe48c47f78696be811ea670fc98c15bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NR4W66GYAWA7OKEXOW6O7ZFAHZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QuPort: Topology-, Port-, and Congestion-Aware Compilation for Modular Multi-QPU Quantum Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"QuPort's TPCCAP finds circuit partitions for multi-QPU systems that jointly minimize cut distance, port overflow, and link congestion on a three-level graph.","cross_cats":["cs.MS"],"primary_cat":"quant-ph","authors_text":"Soumyadip Sarkar, Subhasree Bhattacharjee","submitted_at":"2026-05-12T17:12:30Z","abstract_excerpt":"Modular quantum processors require a compiler to reason about two resources at the same time: local device connectivity and communication across QPUs. A mapping that is acceptable on a single coupling graph may be unsuitable for a modular machine if it creates excessive cross-QPU traffic, concentrates that traffic on a small number of interconnect links, or assigns many boundary qubits to a QPU with few communication ports. This paper presents QuPort, a Python and Qiskit-based compilation framework that studies this setting through an explicit three-level model: a weighted logical interaction "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The main partitioning method, TPCCAP, optimizes the implemented objective formed by weighted cut distance, communication-port overflow, and routed link-load congestion.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That minimizing the weighted combination of cut distance, port overflow, and congestion on the three-level graph model will produce mappings that are meaningfully better on actual modular quantum hardware, without any reported hardware validation or calibrated cost functions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"QuPort introduces a three-level graph model and TPCCAP optimizer for compiling circuits on modular multi-QPU systems while balancing topology, port usage, and link congestion.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"QuPort's TPCCAP finds circuit partitions for multi-QPU systems that jointly minimize cut distance, port overflow, and link congestion on a three-level graph.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"0c8eafcf4d634c9273f55b2746b8c543055fd9d5c25c87c04e870f80abee84aa"},"source":{"id":"2605.12583","kind":"arxiv","version":1},"verdict":{"id":"2906af64-47ed-4541-a6c3-96314e107bee","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:41:40.836393Z","strongest_claim":"The main partitioning method, TPCCAP, optimizes the implemented objective formed by weighted cut distance, communication-port overflow, and routed link-load congestion.","one_line_summary":"QuPort introduces a three-level graph model and TPCCAP optimizer for compiling circuits on modular multi-QPU systems while balancing topology, port usage, and link congestion.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That minimizing the weighted combination of cut distance, port overflow, and congestion on the three-level graph model will produce mappings that are meaningfully better on actual modular quantum hardware, without any reported hardware validation or calibrated cost functions.","pith_extraction_headline":"QuPort's TPCCAP finds circuit partitions for multi-QPU systems that jointly minimize cut distance, port overflow, and link congestion on a three-level graph."},"references":{"count":14,"sample":[{"doi":"10.1016/j.comnet.2024.110672","year":2024,"title":"Distributed quantum computing: a survey","work_id":"f3ceabe9-99dc-4b8f-a9ba-1e4833255c46","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1103/physreva.59.4249","year":1999,"title":"Distributed quantum computation over noisy channels","work_id":"8d50fc90-f9a8-4556-9fb1-a71b31d37ee7","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1038/s41598-022-18989-w","year":2022,"title":"Scientific Reports12, 15421 (2022).https://doi","work_id":"1caa79c2-0b32-4cc1-9275-56fa28b7afad","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/tqe.2021.3053921","year":2021,"title":"IEEE Transactions on Quantum Engineering2, 1–20 (2021).https://doi.org/10.1109/TQE.2021.3053921","work_id":"a5215cc6-99e0-4228-8d38-69099758aab4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/tqe.2023.3303935","year":2023,"title":"A modular quantum compilation framework for distributed quantum computing,","work_id":"d70fe7b8-3f38-4044-b2ea-0715aeea3496","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":14,"snapshot_sha256":"74be3e961a620ac0367483c7e548119f3e88e78d6145df03781deb33e07a67d1","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"2243051693e2d573c22473f1338357b783bb9ab8f77dba56e266d49c52e3bec1"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"2906af64-47ed-4541-a6c3-96314e107bee"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hPtPcE2BuXUtISk/Pt8Y75kQD8qOQYUDteYminThqCSAXtBTPLdBX1deRs0zMy9hgtyFkcXZyGFkiX47a9WBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:23:47.555696Z"},"content_sha256":"5c1bf4a16d842fdd597fdb44b3b73ca510078f2ce02dc8d8a17715867d360533","schema_version":"1.0","event_id":"sha256:5c1bf4a16d842fdd597fdb44b3b73ca510078f2ce02dc8d8a17715867d360533"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NR4W66GYAWA7OKEXOW6O7ZFAHZ/bundle.json","state_url":"https://pith.science/pith/NR4W66GYAWA7OKEXOW6O7ZFAHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NR4W66GYAWA7OKEXOW6O7ZFAHZ/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-05-28T06:23:47Z","links":{"resolver":"https://pith.science/pith/NR4W66GYAWA7OKEXOW6O7ZFAHZ","bundle":"https://pith.science/pith/NR4W66GYAWA7OKEXOW6O7ZFAHZ/bundle.json","state":"https://pith.science/pith/NR4W66GYAWA7OKEXOW6O7ZFAHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NR4W66GYAWA7OKEXOW6O7ZFAHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NR4W66GYAWA7OKEXOW6O7ZFAHZ","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":"e1cf8662dee6575ea4010ff3dc33993a58788150919679cfdf48db9c0b6675e1","cross_cats_sorted":["cs.MS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T17:12:30Z","title_canon_sha256":"bc79d29d4a1856421c3c9b8b63b67196e135910188f63895dd17294c71faaa1b"},"schema_version":"1.0","source":{"id":"2605.12583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12583","created_at":"2026-05-18T03:10:01Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12583v1","created_at":"2026-05-18T03:10:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12583","created_at":"2026-05-18T03:10:01Z"},{"alias_kind":"pith_short_12","alias_value":"NR4W66GYAWA7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"NR4W66GYAWA7OKEX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"NR4W66GY","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:5c1bf4a16d842fdd597fdb44b3b73ca510078f2ce02dc8d8a17715867d360533","target":"graph","created_at":"2026-05-18T03:10:01Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The main partitioning method, TPCCAP, optimizes the implemented objective formed by weighted cut distance, communication-port overflow, and routed link-load congestion."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That minimizing the weighted combination of cut distance, port overflow, and congestion on the three-level graph model will produce mappings that are meaningfully better on actual modular quantum hardware, without any reported hardware validation or calibrated cost functions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"QuPort introduces a three-level graph model and TPCCAP optimizer for compiling circuits on modular multi-QPU systems while balancing topology, port usage, and link congestion."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"QuPort's TPCCAP finds circuit partitions for multi-QPU systems that jointly minimize cut distance, port overflow, and link congestion on a three-level graph."}],"snapshot_sha256":"0c8eafcf4d634c9273f55b2746b8c543055fd9d5c25c87c04e870f80abee84aa"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"2243051693e2d573c22473f1338357b783bb9ab8f77dba56e266d49c52e3bec1"},"paper":{"abstract_excerpt":"Modular quantum processors require a compiler to reason about two resources at the same time: local device connectivity and communication across QPUs. A mapping that is acceptable on a single coupling graph may be unsuitable for a modular machine if it creates excessive cross-QPU traffic, concentrates that traffic on a small number of interconnect links, or assigns many boundary qubits to a QPU with few communication ports. This paper presents QuPort, a Python and Qiskit-based compilation framework that studies this setting through an explicit three-level model: a weighted logical interaction ","authors_text":"Soumyadip Sarkar, Subhasree Bhattacharjee","cross_cats":["cs.MS"],"headline":"QuPort's TPCCAP finds circuit partitions for multi-QPU systems that jointly minimize cut distance, port overflow, and link congestion on a three-level graph.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T17:12:30Z","title":"QuPort: Topology-, Port-, and Congestion-Aware Compilation for Modular Multi-QPU Quantum Systems"},"references":{"count":14,"internal_anchors":0,"resolved_work":14,"sample":[{"cited_arxiv_id":"","doi":"10.1016/j.comnet.2024.110672","is_internal_anchor":false,"ref_index":1,"title":"Distributed quantum computing: a survey","work_id":"f3ceabe9-99dc-4b8f-a9ba-1e4833255c46","year":2024},{"cited_arxiv_id":"","doi":"10.1103/physreva.59.4249","is_internal_anchor":false,"ref_index":2,"title":"Distributed quantum computation over noisy channels","work_id":"8d50fc90-f9a8-4556-9fb1-a71b31d37ee7","year":1999},{"cited_arxiv_id":"","doi":"10.1038/s41598-022-18989-w","is_internal_anchor":false,"ref_index":3,"title":"Scientific Reports12, 15421 (2022).https://doi","work_id":"1caa79c2-0b32-4cc1-9275-56fa28b7afad","year":2022},{"cited_arxiv_id":"","doi":"10.1109/tqe.2021.3053921","is_internal_anchor":false,"ref_index":4,"title":"IEEE Transactions on Quantum Engineering2, 1–20 (2021).https://doi.org/10.1109/TQE.2021.3053921","work_id":"a5215cc6-99e0-4228-8d38-69099758aab4","year":2021},{"cited_arxiv_id":"","doi":"10.1109/tqe.2023.3303935","is_internal_anchor":false,"ref_index":5,"title":"A modular quantum compilation framework for distributed quantum computing,","work_id":"d70fe7b8-3f38-4044-b2ea-0715aeea3496","year":2023}],"snapshot_sha256":"74be3e961a620ac0367483c7e548119f3e88e78d6145df03781deb33e07a67d1"},"source":{"id":"2605.12583","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:41:40.836393Z","id":"2906af64-47ed-4541-a6c3-96314e107bee","model_set":{"reader":"grok-4.3"},"one_line_summary":"QuPort introduces a three-level graph model and TPCCAP optimizer for compiling circuits on modular multi-QPU systems while balancing topology, port usage, and link congestion.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"QuPort's TPCCAP finds circuit partitions for multi-QPU systems that jointly minimize cut distance, port overflow, and link congestion on a three-level graph.","strongest_claim":"The main partitioning method, TPCCAP, optimizes the implemented objective formed by weighted cut distance, communication-port overflow, and routed link-load congestion.","weakest_assumption":"That minimizing the weighted combination of cut distance, port overflow, and congestion on the three-level graph model will produce mappings that are meaningfully better on actual modular quantum hardware, without any reported hardware validation or calibrated cost functions."}},"verdict_id":"2906af64-47ed-4541-a6c3-96314e107bee"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e17c3e381741b90fc8cc0274a3a9ccbffe48c47f78696be811ea670fc98c15bb","target":"record","created_at":"2026-05-18T03:10:01Z","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":"e1cf8662dee6575ea4010ff3dc33993a58788150919679cfdf48db9c0b6675e1","cross_cats_sorted":["cs.MS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T17:12:30Z","title_canon_sha256":"bc79d29d4a1856421c3c9b8b63b67196e135910188f63895dd17294c71faaa1b"},"schema_version":"1.0","source":{"id":"2605.12583","kind":"arxiv","version":1}},"canonical_sha256":"6c796f78d80581f7289775bcefe4a03e626b26041fb350780257a9dac5baa749","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c796f78d80581f7289775bcefe4a03e626b26041fb350780257a9dac5baa749","first_computed_at":"2026-05-18T03:10:01.408845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:01.408845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZnP67n5HXvysdTf1mio7Nv4FxZhEkZE4lBNGNuvLG2rzP0OVISrAJpWvvEkcNAZIkbp9l46AlmtZZjdJPft3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:01.409966Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e17c3e381741b90fc8cc0274a3a9ccbffe48c47f78696be811ea670fc98c15bb","sha256:5c1bf4a16d842fdd597fdb44b3b73ca510078f2ce02dc8d8a17715867d360533"],"state_sha256":"daa62af78d0816234f0d9cffb6e45fe1b984d6600f06a1b7256329f4c23fc561"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A54+bu/+iMJkFQfXKTVK0aL88VynYceS2Fb/L5hFmthMGm77mgF4bQCSD9hF+3e25OGqG3/zwlUWHtO9qLQJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:23:47.559637Z","bundle_sha256":"e096b57ab2e9a744adaaac747c9391a932e2353af0b0d54bf9b712981ca09d54"}}