{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:36M4EVDJ5MGX7KDEWMN263HVWA","short_pith_number":"pith:36M4EVDJ","schema_version":"1.0","canonical_sha256":"df99c25469eb0d7fa864b31baf6cf5b002756c0546a75c95a024175401e2d81d","source":{"kind":"arxiv","id":"2504.09334","version":1},"attestation_state":"computed","paper":{"title":"Spatial and temporal circuit cutting with hypergraphic partitioning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Regina Melo Silveira, Waldemir Cambiucci, Wilson Vicente Ruggiero","submitted_at":"2025-04-12T20:31:07Z","abstract_excerpt":"Quantum computing promises to revolutionize problem-solving through quantum mechanics, but current NISQ devices face limitations in qubit count and error rates, hindering the execution of large-scale quantum circuits. To address these challenges and improve scalability, two main circuit cutting strategies have emerged: the gate-cut approach, which distributes circuit segments across multiple QPUs (spatial), and the qubit wire cut approach, which divides circuits for sequential execution (temporal). This paper presents a hypergraph-based circuit cutting methodology suitable for both spatial and"},"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":"2504.09334","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-12T20:31:07Z","cross_cats_sorted":[],"title_canon_sha256":"63e147c36b01d68801ca6e2fbed783b01ebfeda44e1d32392a9ac8653e27b80f","abstract_canon_sha256":"5fc1062637c1ff081e4398c1b7e5038ac3fecaf3a12ebeb4b6275cea49a16340"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:35.664253Z","signature_b64":"NOXeGgQVg9WKvIDZ8C1DJtpsqGkTOBGX9ezdd9FcFGCF5nVJ9PQpH5jkxiBeVluosuvqbTMSQ/qIeuzuA2nTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df99c25469eb0d7fa864b31baf6cf5b002756c0546a75c95a024175401e2d81d","last_reissued_at":"2026-07-05T10:48:35.663752Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:35.663752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatial and temporal circuit cutting with hypergraphic partitioning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Regina Melo Silveira, Waldemir Cambiucci, Wilson Vicente Ruggiero","submitted_at":"2025-04-12T20:31:07Z","abstract_excerpt":"Quantum computing promises to revolutionize problem-solving through quantum mechanics, but current NISQ devices face limitations in qubit count and error rates, hindering the execution of large-scale quantum circuits. To address these challenges and improve scalability, two main circuit cutting strategies have emerged: the gate-cut approach, which distributes circuit segments across multiple QPUs (spatial), and the qubit wire cut approach, which divides circuits for sequential execution (temporal). This paper presents a hypergraph-based circuit cutting methodology suitable for both spatial and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.09334","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/2504.09334/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":"2504.09334","created_at":"2026-07-05T10:48:35.663811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.09334v1","created_at":"2026-07-05T10:48:35.663811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.09334","created_at":"2026-07-05T10:48:35.663811+00:00"},{"alias_kind":"pith_short_12","alias_value":"36M4EVDJ5MGX","created_at":"2026-07-05T10:48:35.663811+00:00"},{"alias_kind":"pith_short_16","alias_value":"36M4EVDJ5MGX7KDE","created_at":"2026-07-05T10:48:35.663811+00:00"},{"alias_kind":"pith_short_8","alias_value":"36M4EVDJ","created_at":"2026-07-05T10:48:35.663811+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.18888","citing_title":"MOSAIQC: Mixed-topology-aware Optimization for Scalable Approximate noise-Informed Quantum circuit Cutting","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/36M4EVDJ5MGX7KDEWMN263HVWA","json":"https://pith.science/pith/36M4EVDJ5MGX7KDEWMN263HVWA.json","graph_json":"https://pith.science/api/pith-number/36M4EVDJ5MGX7KDEWMN263HVWA/graph.json","events_json":"https://pith.science/api/pith-number/36M4EVDJ5MGX7KDEWMN263HVWA/events.json","paper":"https://pith.science/paper/36M4EVDJ"},"agent_actions":{"view_html":"https://pith.science/pith/36M4EVDJ5MGX7KDEWMN263HVWA","download_json":"https://pith.science/pith/36M4EVDJ5MGX7KDEWMN263HVWA.json","view_paper":"https://pith.science/paper/36M4EVDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.09334&json=true","fetch_graph":"https://pith.science/api/pith-number/36M4EVDJ5MGX7KDEWMN263HVWA/graph.json","fetch_events":"https://pith.science/api/pith-number/36M4EVDJ5MGX7KDEWMN263HVWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36M4EVDJ5MGX7KDEWMN263HVWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36M4EVDJ5MGX7KDEWMN263HVWA/action/storage_attestation","attest_author":"https://pith.science/pith/36M4EVDJ5MGX7KDEWMN263HVWA/action/author_attestation","sign_citation":"https://pith.science/pith/36M4EVDJ5MGX7KDEWMN263HVWA/action/citation_signature","submit_replication":"https://pith.science/pith/36M4EVDJ5MGX7KDEWMN263HVWA/action/replication_record"}},"created_at":"2026-07-05T10:48:35.663811+00:00","updated_at":"2026-07-05T10:48:35.663811+00:00"}