{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:J2MPIGB7RMQG7SDNTJDQRXIDEB","short_pith_number":"pith:J2MPIGB7","canonical_record":{"source":{"id":"2410.08817","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-11T14:00:11Z","cross_cats_sorted":[],"title_canon_sha256":"5f980f882243956fd4f7e8dd35138dba1d99c29648f421c8520b0bff9d519047","abstract_canon_sha256":"10af1e32ab11c02d1a175e2782e88b1fa1985881b79a5148a0d9ccd9420f50fb"},"schema_version":"1.0"},"canonical_sha256":"4e98f4183f8b206fc86d9a4708dd0320689ab3b930aa1efd211d3c0b084ace46","source":{"kind":"arxiv","id":"2410.08817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.08817","created_at":"2026-07-05T09:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"2410.08817v1","created_at":"2026-07-05T09:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08817","created_at":"2026-07-05T09:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"J2MPIGB7RMQG","created_at":"2026-07-05T09:19:18Z"},{"alias_kind":"pith_short_16","alias_value":"J2MPIGB7RMQG7SDN","created_at":"2026-07-05T09:19:18Z"},{"alias_kind":"pith_short_8","alias_value":"J2MPIGB7","created_at":"2026-07-05T09:19:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:J2MPIGB7RMQG7SDNTJDQRXIDEB","target":"record","payload":{"canonical_record":{"source":{"id":"2410.08817","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-11T14:00:11Z","cross_cats_sorted":[],"title_canon_sha256":"5f980f882243956fd4f7e8dd35138dba1d99c29648f421c8520b0bff9d519047","abstract_canon_sha256":"10af1e32ab11c02d1a175e2782e88b1fa1985881b79a5148a0d9ccd9420f50fb"},"schema_version":"1.0"},"canonical_sha256":"4e98f4183f8b206fc86d9a4708dd0320689ab3b930aa1efd211d3c0b084ace46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:18.221701Z","signature_b64":"EvELmK4XMTfOsW0yaSlmXk4QTp8Zzq8h+yhBntwBMd1XPJAUXJSmikXCUYv03q38xzalt+0DgEC93ZDImwvRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e98f4183f8b206fc86d9a4708dd0320689ab3b930aa1efd211d3c0b084ace46","last_reissued_at":"2026-07-05T09:19:18.221209Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:18.221209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.08817","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-07-05T09:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RF9OXZoQ8xlw5D3BzMi9rFFqdw30qIHxh6Ovf4lMIbUVia56+wH+/X9zdTmy5GWTWqHVuCyppetaTWltiBRPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:11:24.637708Z"},"content_sha256":"72232b631558acfda4ebd48523a36eed872837bafa93f4ca21d38082e0ddaee0","schema_version":"1.0","event_id":"sha256:72232b631558acfda4ebd48523a36eed872837bafa93f4ca21d38082e0ddaee0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:J2MPIGB7RMQG7SDNTJDQRXIDEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-based identification of qubit network (GidNET) for qubit reuse","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gideon Uchehara, Olivia Di Matteo, Tor M. Aamodt","submitted_at":"2024-10-11T14:00:11Z","abstract_excerpt":"Quantum computing introduces the challenge of optimizing quantum resources crucial for executing algorithms within the limited qubit availability of current quantum architectures. Existing qubit reuse algorithms face a trade-off between optimality and scalability, with some achieving optimal reuse but limited scalability due to computational complexities, while others exhibit reduced runtime at the expense of optimality. This paper introduces GidNET (Graph-based Identification of qubit NETwork), an algorithm for optimizing qubit reuse in quantum circuits. By analyzing the circuit's Directed Ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08817","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/2410.08817/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-07-05T09:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fbnj2ebF1jhHqH+VQJWqitpv88mfKUPShn0JKc7HqxlZOFDpSjg+AA7pr4Gc6pNekUdAv2rlTCDRbZHjRJDtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:11:24.638073Z"},"content_sha256":"883033da1edeea7756b75137b1713da0ea048e16273a9ce3945284c2a08cbf20","schema_version":"1.0","event_id":"sha256:883033da1edeea7756b75137b1713da0ea048e16273a9ce3945284c2a08cbf20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2MPIGB7RMQG7SDNTJDQRXIDEB/bundle.json","state_url":"https://pith.science/pith/J2MPIGB7RMQG7SDNTJDQRXIDEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2MPIGB7RMQG7SDNTJDQRXIDEB/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-07-06T15:11:24Z","links":{"resolver":"https://pith.science/pith/J2MPIGB7RMQG7SDNTJDQRXIDEB","bundle":"https://pith.science/pith/J2MPIGB7RMQG7SDNTJDQRXIDEB/bundle.json","state":"https://pith.science/pith/J2MPIGB7RMQG7SDNTJDQRXIDEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2MPIGB7RMQG7SDNTJDQRXIDEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:J2MPIGB7RMQG7SDNTJDQRXIDEB","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":"10af1e32ab11c02d1a175e2782e88b1fa1985881b79a5148a0d9ccd9420f50fb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-11T14:00:11Z","title_canon_sha256":"5f980f882243956fd4f7e8dd35138dba1d99c29648f421c8520b0bff9d519047"},"schema_version":"1.0","source":{"id":"2410.08817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.08817","created_at":"2026-07-05T09:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"2410.08817v1","created_at":"2026-07-05T09:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08817","created_at":"2026-07-05T09:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"J2MPIGB7RMQG","created_at":"2026-07-05T09:19:18Z"},{"alias_kind":"pith_short_16","alias_value":"J2MPIGB7RMQG7SDN","created_at":"2026-07-05T09:19:18Z"},{"alias_kind":"pith_short_8","alias_value":"J2MPIGB7","created_at":"2026-07-05T09:19:18Z"}],"graph_snapshots":[{"event_id":"sha256:883033da1edeea7756b75137b1713da0ea048e16273a9ce3945284c2a08cbf20","target":"graph","created_at":"2026-07-05T09:19:18Z","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/2410.08817/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum computing introduces the challenge of optimizing quantum resources crucial for executing algorithms within the limited qubit availability of current quantum architectures. Existing qubit reuse algorithms face a trade-off between optimality and scalability, with some achieving optimal reuse but limited scalability due to computational complexities, while others exhibit reduced runtime at the expense of optimality. This paper introduces GidNET (Graph-based Identification of qubit NETwork), an algorithm for optimizing qubit reuse in quantum circuits. By analyzing the circuit's Directed Ac","authors_text":"Gideon Uchehara, Olivia Di Matteo, Tor M. Aamodt","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-11T14:00:11Z","title":"Graph-based identification of qubit network (GidNET) for qubit reuse"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08817","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:72232b631558acfda4ebd48523a36eed872837bafa93f4ca21d38082e0ddaee0","target":"record","created_at":"2026-07-05T09:19:18Z","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":"10af1e32ab11c02d1a175e2782e88b1fa1985881b79a5148a0d9ccd9420f50fb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-11T14:00:11Z","title_canon_sha256":"5f980f882243956fd4f7e8dd35138dba1d99c29648f421c8520b0bff9d519047"},"schema_version":"1.0","source":{"id":"2410.08817","kind":"arxiv","version":1}},"canonical_sha256":"4e98f4183f8b206fc86d9a4708dd0320689ab3b930aa1efd211d3c0b084ace46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e98f4183f8b206fc86d9a4708dd0320689ab3b930aa1efd211d3c0b084ace46","first_computed_at":"2026-07-05T09:19:18.221209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:19:18.221209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EvELmK4XMTfOsW0yaSlmXk4QTp8Zzq8h+yhBntwBMd1XPJAUXJSmikXCUYv03q38xzalt+0DgEC93ZDImwvRCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:19:18.221701Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.08817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72232b631558acfda4ebd48523a36eed872837bafa93f4ca21d38082e0ddaee0","sha256:883033da1edeea7756b75137b1713da0ea048e16273a9ce3945284c2a08cbf20"],"state_sha256":"55c200b27fc25e41de923ec3dd8753db54f7cefc3d37f79676965db088e16a44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"32WrP23deLNa8ahNIaQ4tzqxbEkY3KbwUJdYnwuMXl4v6OqFPClH0CdZqRB1PE85POrT8FTKSYKq2FIIIcrGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:11:24.639955Z","bundle_sha256":"a4ad988c49367586b24550584be27d55e684eaa401bf7ee904f37aa61333e045"}}