{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UCFKCFMEJ6YDE2JBUV6I4CTAWD","short_pith_number":"pith:UCFKCFME","schema_version":"1.0","canonical_sha256":"a08aa115844fb0326921a57c8e0a60b0d695166ba3f9f0a05bfc7a3fe7b59930","source":{"kind":"arxiv","id":"2501.10242","version":1},"attestation_state":"computed","paper":{"title":"Resource-Efficient Compilation of Distributed Quantum Circuits for Solving Large-Scale Wireless Communication Network Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Chen-Yu Liu, Felix Burt, Kin K. Leung, Kuan-Cheng Chen, Min-Hsiu Hsieh, Shang Yu","submitted_at":"2025-01-17T15:10:22Z","abstract_excerpt":"Optimizing routing in Wireless Sensor Networks (WSNs) is pivotal for minimizing energy consumption and extending network lifetime. This paper introduces a resourceefficient compilation method for distributed quantum circuits tailored to address large-scale WSN routing problems. Leveraging a hybrid classical-quantum framework, we employ spectral clustering for network partitioning and the Quantum Approximate Optimization Algorithm (QAOA) for optimizing routing within manageable subgraphs. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, providing"},"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":"2501.10242","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-17T15:10:22Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c8f3010cbade406d973176fccf11a7c016a9260a3d7d8d330fa62f2e1be76975","abstract_canon_sha256":"b541e161b572186f3f15f2ad23293a7c842c05427045f9dcc5b8de41bb809770"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:18.925808Z","signature_b64":"TguLN8LfHGniZid5TkjCIqY5At5uypBx75aFPmysBdS+BIKY58N3t6d4G6u30JNprBpm3CArErDeaor4p0ssAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a08aa115844fb0326921a57c8e0a60b0d695166ba3f9f0a05bfc7a3fe7b59930","last_reissued_at":"2026-07-05T10:02:18.925202Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:18.925202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource-Efficient Compilation of Distributed Quantum Circuits for Solving Large-Scale Wireless Communication Network Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Chen-Yu Liu, Felix Burt, Kin K. Leung, Kuan-Cheng Chen, Min-Hsiu Hsieh, Shang Yu","submitted_at":"2025-01-17T15:10:22Z","abstract_excerpt":"Optimizing routing in Wireless Sensor Networks (WSNs) is pivotal for minimizing energy consumption and extending network lifetime. This paper introduces a resourceefficient compilation method for distributed quantum circuits tailored to address large-scale WSN routing problems. Leveraging a hybrid classical-quantum framework, we employ spectral clustering for network partitioning and the Quantum Approximate Optimization Algorithm (QAOA) for optimizing routing within manageable subgraphs. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, providing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10242","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/2501.10242/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":"2501.10242","created_at":"2026-07-05T10:02:18.925271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.10242v1","created_at":"2026-07-05T10:02:18.925271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10242","created_at":"2026-07-05T10:02:18.925271+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCFKCFMEJ6YD","created_at":"2026-07-05T10:02:18.925271+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCFKCFMEJ6YDE2JB","created_at":"2026-07-05T10:02:18.925271+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCFKCFME","created_at":"2026-07-05T10:02:18.925271+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.09395","citing_title":"Quantum-Enhanced Parameter-Efficient Learning for Typhoon Trajectory Forecasting","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UCFKCFMEJ6YDE2JBUV6I4CTAWD","json":"https://pith.science/pith/UCFKCFMEJ6YDE2JBUV6I4CTAWD.json","graph_json":"https://pith.science/api/pith-number/UCFKCFMEJ6YDE2JBUV6I4CTAWD/graph.json","events_json":"https://pith.science/api/pith-number/UCFKCFMEJ6YDE2JBUV6I4CTAWD/events.json","paper":"https://pith.science/paper/UCFKCFME"},"agent_actions":{"view_html":"https://pith.science/pith/UCFKCFMEJ6YDE2JBUV6I4CTAWD","download_json":"https://pith.science/pith/UCFKCFMEJ6YDE2JBUV6I4CTAWD.json","view_paper":"https://pith.science/paper/UCFKCFME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.10242&json=true","fetch_graph":"https://pith.science/api/pith-number/UCFKCFMEJ6YDE2JBUV6I4CTAWD/graph.json","fetch_events":"https://pith.science/api/pith-number/UCFKCFMEJ6YDE2JBUV6I4CTAWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCFKCFMEJ6YDE2JBUV6I4CTAWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCFKCFMEJ6YDE2JBUV6I4CTAWD/action/storage_attestation","attest_author":"https://pith.science/pith/UCFKCFMEJ6YDE2JBUV6I4CTAWD/action/author_attestation","sign_citation":"https://pith.science/pith/UCFKCFMEJ6YDE2JBUV6I4CTAWD/action/citation_signature","submit_replication":"https://pith.science/pith/UCFKCFMEJ6YDE2JBUV6I4CTAWD/action/replication_record"}},"created_at":"2026-07-05T10:02:18.925271+00:00","updated_at":"2026-07-05T10:02:18.925271+00:00"}