{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:6SRTXOFING4WB4WBIVXU3ZVFLV","short_pith_number":"pith:6SRTXOFI","canonical_record":{"source":{"id":"2310.00444","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-30T17:38:31Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"8a71a9dc64ebca25af1363742263e96779f098586bec7dcddc0eb082fa2761cc","abstract_canon_sha256":"3c102fca0fb60e60bf3eec1719b419c49e3a50420838e3eaefe7a7c6631efac0"},"schema_version":"1.0"},"canonical_sha256":"f4a33bb8a869b960f2c1456f4de6a55d4eb23e00a21fea7b9a1d82ed49acadbc","source":{"kind":"arxiv","id":"2310.00444","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.00444","created_at":"2026-07-05T08:35:37Z"},{"alias_kind":"arxiv_version","alias_value":"2310.00444v1","created_at":"2026-07-05T08:35:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.00444","created_at":"2026-07-05T08:35:37Z"},{"alias_kind":"pith_short_12","alias_value":"6SRTXOFING4W","created_at":"2026-07-05T08:35:37Z"},{"alias_kind":"pith_short_16","alias_value":"6SRTXOFING4WB4WB","created_at":"2026-07-05T08:35:37Z"},{"alias_kind":"pith_short_8","alias_value":"6SRTXOFI","created_at":"2026-07-05T08:35:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:6SRTXOFING4WB4WBIVXU3ZVFLV","target":"record","payload":{"canonical_record":{"source":{"id":"2310.00444","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-30T17:38:31Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"8a71a9dc64ebca25af1363742263e96779f098586bec7dcddc0eb082fa2761cc","abstract_canon_sha256":"3c102fca0fb60e60bf3eec1719b419c49e3a50420838e3eaefe7a7c6631efac0"},"schema_version":"1.0"},"canonical_sha256":"f4a33bb8a869b960f2c1456f4de6a55d4eb23e00a21fea7b9a1d82ed49acadbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:37.814461Z","signature_b64":"oBzI4w5B4/tfABFc3M6a+gUrRw5v2gBPcZAV52qYxcV+Z2T6XopFJo99PfZJS0xbLBUZhhA0oHHOVhoYaN7sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4a33bb8a869b960f2c1456f4de6a55d4eb23e00a21fea7b9a1d82ed49acadbc","last_reissued_at":"2026-07-05T08:35:37.814017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:37.814017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.00444","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-05T08:35:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kg6vIyMxsIxNKZmAE0cX+FYSf9wPljfHj8M7KDG4rO/1rdRbroQFA8qkNLYYDKON69fYWqwsWIi2+MevcBDTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:38:14.615039Z"},"content_sha256":"abe2784d3265c1d817617311f33755faf23babed5d9ae8f572fe58ed77d084b8","schema_version":"1.0","event_id":"sha256:abe2784d3265c1d817617311f33755faf23babed5d9ae8f572fe58ed77d084b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:6SRTXOFING4WB4WBIVXU3ZVFLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Amit Saha, Amlan Chakrabarti, Arnav Das, Saikat Basu, Susmita Sur-Kolay","submitted_at":"2023-09-30T17:38:31Z","abstract_excerpt":"Quantum computers must meet extremely stringent qualitative and quantitative requirements on their qubits in order to solve real-life problems. Quantum circuit fragmentation techniques divide a large quantum circuit into a number of sub-circuits that can be executed on the smaller noisy quantum hardware available. However, the process of quantum circuit fragmentation involves finding an ideal cut that has exponential time complexity, and also classical post-processing required to reconstruct the output. In this paper, we represent a quantum circuit using a weighted graph and propose a novel cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.00444","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/2310.00444/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-05T08:35:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8FvXzU/1oMlxOPI/NZijzKpNCV/jC9Z5dyUTGM4ABgujiWiuFp2ncGEaocYERkrtxBA5VmCTYg2p+TBRNBrdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:38:14.615907Z"},"content_sha256":"dcb838ab01120f550eb0cf08db83bf96263817a5ad80d1472bf168e2d1cfffc0","schema_version":"1.0","event_id":"sha256:dcb838ab01120f550eb0cf08db83bf96263817a5ad80d1472bf168e2d1cfffc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SRTXOFING4WB4WBIVXU3ZVFLV/bundle.json","state_url":"https://pith.science/pith/6SRTXOFING4WB4WBIVXU3ZVFLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SRTXOFING4WB4WBIVXU3ZVFLV/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-08-06T18:38:14Z","links":{"resolver":"https://pith.science/pith/6SRTXOFING4WB4WBIVXU3ZVFLV","bundle":"https://pith.science/pith/6SRTXOFING4WB4WBIVXU3ZVFLV/bundle.json","state":"https://pith.science/pith/6SRTXOFING4WB4WBIVXU3ZVFLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SRTXOFING4WB4WBIVXU3ZVFLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6SRTXOFING4WB4WBIVXU3ZVFLV","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":"3c102fca0fb60e60bf3eec1719b419c49e3a50420838e3eaefe7a7c6631efac0","cross_cats_sorted":["cs.ET"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-30T17:38:31Z","title_canon_sha256":"8a71a9dc64ebca25af1363742263e96779f098586bec7dcddc0eb082fa2761cc"},"schema_version":"1.0","source":{"id":"2310.00444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.00444","created_at":"2026-07-05T08:35:37Z"},{"alias_kind":"arxiv_version","alias_value":"2310.00444v1","created_at":"2026-07-05T08:35:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.00444","created_at":"2026-07-05T08:35:37Z"},{"alias_kind":"pith_short_12","alias_value":"6SRTXOFING4W","created_at":"2026-07-05T08:35:37Z"},{"alias_kind":"pith_short_16","alias_value":"6SRTXOFING4WB4WB","created_at":"2026-07-05T08:35:37Z"},{"alias_kind":"pith_short_8","alias_value":"6SRTXOFI","created_at":"2026-07-05T08:35:37Z"}],"graph_snapshots":[{"event_id":"sha256:dcb838ab01120f550eb0cf08db83bf96263817a5ad80d1472bf168e2d1cfffc0","target":"graph","created_at":"2026-07-05T08:35:37Z","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/2310.00444/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum computers must meet extremely stringent qualitative and quantitative requirements on their qubits in order to solve real-life problems. Quantum circuit fragmentation techniques divide a large quantum circuit into a number of sub-circuits that can be executed on the smaller noisy quantum hardware available. However, the process of quantum circuit fragmentation involves finding an ideal cut that has exponential time complexity, and also classical post-processing required to reconstruct the output. In this paper, we represent a quantum circuit using a weighted graph and propose a novel cl","authors_text":"Amit Saha, Amlan Chakrabarti, Arnav Das, Saikat Basu, Susmita Sur-Kolay","cross_cats":["cs.ET"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-30T17:38:31Z","title":"FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.00444","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:abe2784d3265c1d817617311f33755faf23babed5d9ae8f572fe58ed77d084b8","target":"record","created_at":"2026-07-05T08:35:37Z","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":"3c102fca0fb60e60bf3eec1719b419c49e3a50420838e3eaefe7a7c6631efac0","cross_cats_sorted":["cs.ET"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-30T17:38:31Z","title_canon_sha256":"8a71a9dc64ebca25af1363742263e96779f098586bec7dcddc0eb082fa2761cc"},"schema_version":"1.0","source":{"id":"2310.00444","kind":"arxiv","version":1}},"canonical_sha256":"f4a33bb8a869b960f2c1456f4de6a55d4eb23e00a21fea7b9a1d82ed49acadbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4a33bb8a869b960f2c1456f4de6a55d4eb23e00a21fea7b9a1d82ed49acadbc","first_computed_at":"2026-07-05T08:35:37.814017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:35:37.814017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oBzI4w5B4/tfABFc3M6a+gUrRw5v2gBPcZAV52qYxcV+Z2T6XopFJo99PfZJS0xbLBUZhhA0oHHOVhoYaN7sCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:35:37.814461Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.00444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abe2784d3265c1d817617311f33755faf23babed5d9ae8f572fe58ed77d084b8","sha256:dcb838ab01120f550eb0cf08db83bf96263817a5ad80d1472bf168e2d1cfffc0"],"state_sha256":"6f8feb88c32972eb8e953eb20087648ec357b517a0514fb799dbe2627a389235"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZ1XchKKzG4ye5Ui/EK0JK0Wr0U7bDt0Sz6RbqVqhc8fmtPUOcW0Uev76Aerp8WFeT1FAXIeqEmFHLKGvzujDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T18:38:14.621584Z","bundle_sha256":"f3690a820712903df1229055d5b245861b463a973976e31381132d0eef56a539"}}