{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NDAGKC6QAB46EYQJKRL57VZOSA","short_pith_number":"pith:NDAGKC6Q","canonical_record":{"source":{"id":"2110.04637","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-09T19:45:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ee5379679b8641b22c5725b742943e7fbfa09de058d88b3ab1d797fdce0b7e49","abstract_canon_sha256":"86ef28d8212b1ae5e756e20e5e09080cda9d3ea7edb717ea848672289413be9a"},"schema_version":"1.0"},"canonical_sha256":"68c0650bd00079e262095457dfd72e903734912015554b6f116e8a9197c332c2","source":{"kind":"arxiv","id":"2110.04637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.04637","created_at":"2026-07-05T03:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"2110.04637v1","created_at":"2026-07-05T03:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04637","created_at":"2026-07-05T03:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"NDAGKC6QAB46","created_at":"2026-07-05T03:21:19Z"},{"alias_kind":"pith_short_16","alias_value":"NDAGKC6QAB46EYQJ","created_at":"2026-07-05T03:21:19Z"},{"alias_kind":"pith_short_8","alias_value":"NDAGKC6Q","created_at":"2026-07-05T03:21:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NDAGKC6QAB46EYQJKRL57VZOSA","target":"record","payload":{"canonical_record":{"source":{"id":"2110.04637","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-09T19:45:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ee5379679b8641b22c5725b742943e7fbfa09de058d88b3ab1d797fdce0b7e49","abstract_canon_sha256":"86ef28d8212b1ae5e756e20e5e09080cda9d3ea7edb717ea848672289413be9a"},"schema_version":"1.0"},"canonical_sha256":"68c0650bd00079e262095457dfd72e903734912015554b6f116e8a9197c332c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:19.559055Z","signature_b64":"gmnM14Jkyx/Uj4Lh66WcfgeXUUOgOgOjR52k39gadWp0gKm4jCB3oSGXzG+2O8qAJlZDGv2yAhhLMshR3yjaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68c0650bd00079e262095457dfd72e903734912015554b6f116e8a9197c332c2","last_reissued_at":"2026-07-05T03:21:19.558647Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:19.558647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.04637","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-05T03:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04aKDAiAOzXEveeiRkLol2uWhHnnGeB9iNRbVe/qtliWjyQj7VX07zIsFBLFT/OetmSGm7kYBxi50GtUaiZEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:46:39.654634Z"},"content_sha256":"2383bd554a72e273eb1d58bc61bd3fb84bf9b8268d4dca66d0d27354a713a420","schema_version":"1.0","event_id":"sha256:2383bd554a72e273eb1d58bc61bd3fb84bf9b8268d4dca66d0d27354a713a420"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NDAGKC6QAB46EYQJKRL57VZOSA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Depth Optimized Ansatz Circuit in QAOA for Max-Cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Debasmita Bhoumik, Dhinakaran Vinayagamurthy, Dhiraj Madan, Ritajit Majumdar, Shesha Raghunathan, Susmita Sur-Kolay","submitted_at":"2021-10-09T19:45:12Z","abstract_excerpt":"While a Quantum Approximate Optimization Algorithm (QAOA) is intended to provide a quantum advantage in finding approximate solutions to combinatorial optimization problems, noise in the system is a hurdle in exploiting its full potential. Several error mitigation techniques have been studied to lessen the effect of noise on this algorithm. Recently, Majumdar et al. proposed a Depth First Search (DFS) based method to reduce $n-1$ CNOT gates in the ansatz design of QAOA for finding Max-Cut in a graph G = (V, E), |V| = n. However, this method tends to increase the depth of the circuit, making it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04637","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/2110.04637/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-05T03:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gF6rTeRb1k/4OBSt8aBblUljGsGnRhMJqdx/+Y6oltyYfltq/0t/hcb4wXIKNkAy5DHLRW6Aj1JefP/IvjL4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:46:39.655007Z"},"content_sha256":"d0be3d70989820da6692952819815dbd3578bedd27304f2c041c169416ed0e16","schema_version":"1.0","event_id":"sha256:d0be3d70989820da6692952819815dbd3578bedd27304f2c041c169416ed0e16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA/bundle.json","state_url":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDAGKC6QAB46EYQJKRL57VZOSA/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-06T20:46:39Z","links":{"resolver":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA","bundle":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA/bundle.json","state":"https://pith.science/pith/NDAGKC6QAB46EYQJKRL57VZOSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDAGKC6QAB46EYQJKRL57VZOSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NDAGKC6QAB46EYQJKRL57VZOSA","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":"86ef28d8212b1ae5e756e20e5e09080cda9d3ea7edb717ea848672289413be9a","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-09T19:45:12Z","title_canon_sha256":"ee5379679b8641b22c5725b742943e7fbfa09de058d88b3ab1d797fdce0b7e49"},"schema_version":"1.0","source":{"id":"2110.04637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.04637","created_at":"2026-07-05T03:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"2110.04637v1","created_at":"2026-07-05T03:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04637","created_at":"2026-07-05T03:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"NDAGKC6QAB46","created_at":"2026-07-05T03:21:19Z"},{"alias_kind":"pith_short_16","alias_value":"NDAGKC6QAB46EYQJ","created_at":"2026-07-05T03:21:19Z"},{"alias_kind":"pith_short_8","alias_value":"NDAGKC6Q","created_at":"2026-07-05T03:21:19Z"}],"graph_snapshots":[{"event_id":"sha256:d0be3d70989820da6692952819815dbd3578bedd27304f2c041c169416ed0e16","target":"graph","created_at":"2026-07-05T03:21:19Z","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/2110.04637/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While a Quantum Approximate Optimization Algorithm (QAOA) is intended to provide a quantum advantage in finding approximate solutions to combinatorial optimization problems, noise in the system is a hurdle in exploiting its full potential. Several error mitigation techniques have been studied to lessen the effect of noise on this algorithm. Recently, Majumdar et al. proposed a Depth First Search (DFS) based method to reduce $n-1$ CNOT gates in the ansatz design of QAOA for finding Max-Cut in a graph G = (V, E), |V| = n. However, this method tends to increase the depth of the circuit, making it","authors_text":"Debasmita Bhoumik, Dhinakaran Vinayagamurthy, Dhiraj Madan, Ritajit Majumdar, Shesha Raghunathan, Susmita Sur-Kolay","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-09T19:45:12Z","title":"Depth Optimized Ansatz Circuit in QAOA for Max-Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04637","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:2383bd554a72e273eb1d58bc61bd3fb84bf9b8268d4dca66d0d27354a713a420","target":"record","created_at":"2026-07-05T03:21:19Z","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":"86ef28d8212b1ae5e756e20e5e09080cda9d3ea7edb717ea848672289413be9a","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-09T19:45:12Z","title_canon_sha256":"ee5379679b8641b22c5725b742943e7fbfa09de058d88b3ab1d797fdce0b7e49"},"schema_version":"1.0","source":{"id":"2110.04637","kind":"arxiv","version":1}},"canonical_sha256":"68c0650bd00079e262095457dfd72e903734912015554b6f116e8a9197c332c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68c0650bd00079e262095457dfd72e903734912015554b6f116e8a9197c332c2","first_computed_at":"2026-07-05T03:21:19.558647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:21:19.558647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gmnM14Jkyx/Uj4Lh66WcfgeXUUOgOgOjR52k39gadWp0gKm4jCB3oSGXzG+2O8qAJlZDGv2yAhhLMshR3yjaDg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:21:19.559055Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.04637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2383bd554a72e273eb1d58bc61bd3fb84bf9b8268d4dca66d0d27354a713a420","sha256:d0be3d70989820da6692952819815dbd3578bedd27304f2c041c169416ed0e16"],"state_sha256":"7d6a588a1e94aa6fb9abacda145fb2a737406833da3081198acbd6cd0540ea0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ab772Lt9dsgtka3VaYlI7KjIHcUJHl0sJGBreQXBHPiPgFebHb6GSzC5vFwKKtmOGXJ8fRVha6TpCV39IMg7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:46:39.657009Z","bundle_sha256":"b7ad86ee6d587864c619747bab5f1e2bd6c746331b93afa8a4bd315d4fdb9fe9"}}