{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MGM6XCGPHQBYTGQOUVOESTLTLB","short_pith_number":"pith:MGM6XCGP","schema_version":"1.0","canonical_sha256":"6199eb88cf3c03899a0ea55c494d73584f2679ebb6b545ce41e3f63a88eb8555","source":{"kind":"arxiv","id":"2410.04409","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.04409","created_at":"2026-07-05T10:11:25.279321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.04409v2","created_at":"2026-07-05T10:11:25.279321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04409","created_at":"2026-07-05T10:11:25.279321+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGM6XCGPHQBY","created_at":"2026-07-05T10:11:25.279321+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGM6XCGPHQBYTGQO","created_at":"2026-07-05T10:11:25.279321+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGM6XCGP","created_at":"2026-07-05T10:11:25.279321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB","json":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB.json","graph_json":"https://pith.science/api/pith-number/MGM6XCGPHQBYTGQOUVOESTLTLB/graph.json","events_json":"https://pith.science/api/pith-number/MGM6XCGPHQBYTGQOUVOESTLTLB/events.json","paper":"https://pith.science/paper/MGM6XCGP"},"agent_actions":{"view_html":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB","download_json":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB.json","view_paper":"https://pith.science/paper/MGM6XCGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.04409&json=true","fetch_graph":"https://pith.science/api/pith-number/MGM6XCGPHQBYTGQOUVOESTLTLB/graph.json","fetch_events":"https://pith.science/api/pith-number/MGM6XCGPHQBYTGQOUVOESTLTLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB/action/storage_attestation","attest_author":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB/action/author_attestation","sign_citation":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB/action/citation_signature","submit_replication":"https://pith.science/pith/MGM6XCGPHQBYTGQOUVOESTLTLB/action/replication_record"}},"created_at":"2026-07-05T10:11:25.279321+00:00","updated_at":"2026-07-05T10:11:25.279321+00:00"}