{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:MGM6XCGPHQBYTGQOUVOESTLTLB","short_pith_number":"pith:MGM6XCGP","canonical_record":{"source":{"id":"2410.04409","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-06T08:57:30Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"4f166e859a4ea5a186fad9d891df948a98b85e54f6b869ff0ea55aa868272d6d","abstract_canon_sha256":"a7f437b6a84c4291bc57391d336233de4f40fcb497bb3cdd91d659972ea26101"},"schema_version":"1.0"},"canonical_sha256":"6199eb88cf3c03899a0ea55c494d73584f2679ebb6b545ce41e3f63a88eb8555","source":{"kind":"arxiv","id":"2410.04409","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.04409","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2410.04409v2","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04409","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"MGM6XCGPHQBY","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"MGM6XCGPHQBYTGQO","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"MGM6XCGP","created_at":"2026-07-05T10:11:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:MGM6XCGPHQBYTGQOUVOESTLTLB","target":"record","payload":{"canonical_record":{"source":{"id":"2410.04409","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-06T08:57:30Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"4f166e859a4ea5a186fad9d891df948a98b85e54f6b869ff0ea55aa868272d6d","abstract_canon_sha256":"a7f437b6a84c4291bc57391d336233de4f40fcb497bb3cdd91d659972ea26101"},"schema_version":"1.0"},"canonical_sha256":"6199eb88cf3c03899a0ea55c494d73584f2679ebb6b545ce41e3f63a88eb8555","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:25.279820Z","signature_b64":"XHqNTEq3+a+PKTG+WHkeTmxGe5Rnh1nBI3HXWBdr8RpWTpFOb19jbEt/FZII34LqQtM10v784hw8FLbovGaEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6199eb88cf3c03899a0ea55c494d73584f2679ebb6b545ce41e3f63a88eb8555","last_reissued_at":"2026-07-05T10:11:25.279256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:25.279256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.04409","source_version":2,"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-05T10:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MrwcQrmq6b1HLLWijvqVnDqZQPWzWJw798rtvOf2fBgkzvJnculG5oQNvmna7xwInbVkAlm/WwCJzERMHoI/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:48:53.507296Z"},"content_sha256":"5e7917e9a1b9f5c734234cd021b1f0f1916cafe5fd567182a7fd63d32ce688c7","schema_version":"1.0","event_id":"sha256:5e7917e9a1b9f5c734234cd021b1f0f1916cafe5fd567182a7fd63d32ce688c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:MGM6XCGPHQBYTGQOUVOESTLTLB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Shengyu Zhang, Tongyang Li, Yuexin Su, Ziyi Yang","submitted_at":"2024-10-06T08:57:30Z","abstract_excerpt":"Maximum cut (MaxCut) on graphs is a classic NP-hard problem. In quantum computing, Farhi, Gutmann, and Goldstone proposed the Quantum Approximate Optimization Algorithm (QAOA) for solving the MaxCut problem. Its guarantee on cut fraction (the fraction of edges in the output cut over all edges) was mainly studied for high-girth graphs, i.e., graphs with only long cycles. On the other hand, low-girth graphs are ubiquitous in theoretical computer science, including expander graphs being outstanding examples with wide applications in theory and beyond. In this paper, we apply QAOA to MaxCut on a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.04409","kind":"arxiv","version":2},"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.04409/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-05T10:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TiPM1tL6uPyloWKN36pzjEwCMajU/cH0f8FhT9m3IQUnIC14Mrk5NqB6fMk7YsEr57q+BEM9qTjQsLeVVAfaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:48:53.507788Z"},"content_sha256":"7b7c0ede0b3554af539fd99f1a29bb1e60b3bf06398c451736669fa15e9c5627","schema_version":"1.0","event_id":"sha256:7b7c0ede0b3554af539fd99f1a29bb1e60b3bf06398c451736669fa15e9c5627"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB/bundle.json","state_url":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGM6XCGPHQBYTGQOUVOESTLTLB/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-06T13:48:53Z","links":{"resolver":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB","bundle":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB/bundle.json","state":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGM6XCGPHQBYTGQOUVOESTLTLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MGM6XCGPHQBYTGQOUVOESTLTLB","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":"a7f437b6a84c4291bc57391d336233de4f40fcb497bb3cdd91d659972ea26101","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-06T08:57:30Z","title_canon_sha256":"4f166e859a4ea5a186fad9d891df948a98b85e54f6b869ff0ea55aa868272d6d"},"schema_version":"1.0","source":{"id":"2410.04409","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.04409","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2410.04409v2","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04409","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"MGM6XCGPHQBY","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"MGM6XCGPHQBYTGQO","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"MGM6XCGP","created_at":"2026-07-05T10:11:25Z"}],"graph_snapshots":[{"event_id":"sha256:7b7c0ede0b3554af539fd99f1a29bb1e60b3bf06398c451736669fa15e9c5627","target":"graph","created_at":"2026-07-05T10:11:25Z","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.04409/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Maximum cut (MaxCut) on graphs is a classic NP-hard problem. In quantum computing, Farhi, Gutmann, and Goldstone proposed the Quantum Approximate Optimization Algorithm (QAOA) for solving the MaxCut problem. Its guarantee on cut fraction (the fraction of edges in the output cut over all edges) was mainly studied for high-girth graphs, i.e., graphs with only long cycles. On the other hand, low-girth graphs are ubiquitous in theoretical computer science, including expander graphs being outstanding examples with wide applications in theory and beyond. In this paper, we apply QAOA to MaxCut on a s","authors_text":"Shengyu Zhang, Tongyang Li, Yuexin Su, Ziyi Yang","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-06T08:57:30Z","title":"Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.04409","kind":"arxiv","version":2},"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:5e7917e9a1b9f5c734234cd021b1f0f1916cafe5fd567182a7fd63d32ce688c7","target":"record","created_at":"2026-07-05T10:11:25Z","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":"a7f437b6a84c4291bc57391d336233de4f40fcb497bb3cdd91d659972ea26101","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-06T08:57:30Z","title_canon_sha256":"4f166e859a4ea5a186fad9d891df948a98b85e54f6b869ff0ea55aa868272d6d"},"schema_version":"1.0","source":{"id":"2410.04409","kind":"arxiv","version":2}},"canonical_sha256":"6199eb88cf3c03899a0ea55c494d73584f2679ebb6b545ce41e3f63a88eb8555","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6199eb88cf3c03899a0ea55c494d73584f2679ebb6b545ce41e3f63a88eb8555","first_computed_at":"2026-07-05T10:11:25.279256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:25.279256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XHqNTEq3+a+PKTG+WHkeTmxGe5Rnh1nBI3HXWBdr8RpWTpFOb19jbEt/FZII34LqQtM10v784hw8FLbovGaEAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:25.279820Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.04409","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e7917e9a1b9f5c734234cd021b1f0f1916cafe5fd567182a7fd63d32ce688c7","sha256:7b7c0ede0b3554af539fd99f1a29bb1e60b3bf06398c451736669fa15e9c5627"],"state_sha256":"9e7276eac4bdb65b81e1060abc25824ae643089cb63f069e89a9cde4e15f25bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZniuvcSM8367vv5J9AdFVR251i2wouyKyhiIhXXqTyjdTO/sa3/1vkVWgiVxEF6W/X1Mf6C0KcsRrzf+UaxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T13:48:53.549245Z","bundle_sha256":"d456114ed357ea44d881e22b069ad637f722a89b6cf82fa867718400a2d23cf2"}}