{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DVYIR7SPZNEVHJFKOW32E3XHR5","short_pith_number":"pith:DVYIR7SP","schema_version":"1.0","canonical_sha256":"1d7088fe4fcb4953a4aa75b7a26ee78f6898d557fc8d9a06fcaaac14e411e6ae","source":{"kind":"arxiv","id":"2411.08119","version":2},"attestation_state":"computed","paper":{"title":"Genuine Multipartite Entanglement in Quantum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel J. Egger, Gopal Chandra Santra, Philipp Hauke, Sudipto Singha Roy","submitted_at":"2024-11-12T19:00:16Z","abstract_excerpt":"The ability to generate bipartite entanglement in quantum computing technologies is widely regarded as pivotal. However, the role of genuinely multipartite entanglement is much less understood than bipartite entanglement, particularly in the context of solving complicated optimization problems using quantum devices. It is thus crucial from both the algorithmic and hardware standpoints to understand whether multipartite entanglement contributes to achieving a good solution. Here, we tackle this challenge by analyzing genuine multipartite entanglement -- quantified by the generalized geometric m"},"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":"2411.08119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-12T19:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"81b5ec7cf0be95e0bf7c0f685b6a74f4f5dae3fcf7b7cb6a78e5dd78e785f3a0","abstract_canon_sha256":"c0131aabb3de6352459d69447747724b3ab5a8ef43a55056c35976e6b2e06331"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:17:51.492719Z","signature_b64":"xavBFgOcT9UrfiHBVAs5xZnC3lJaZGub1dglaOOQjKHRyVqZ3leML9p4o7/i19mkOzE14obiUrXxEC2zCNIdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d7088fe4fcb4953a4aa75b7a26ee78f6898d557fc8d9a06fcaaac14e411e6ae","last_reissued_at":"2026-07-05T10:17:51.492254Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:17:51.492254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genuine Multipartite Entanglement in Quantum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel J. Egger, Gopal Chandra Santra, Philipp Hauke, Sudipto Singha Roy","submitted_at":"2024-11-12T19:00:16Z","abstract_excerpt":"The ability to generate bipartite entanglement in quantum computing technologies is widely regarded as pivotal. However, the role of genuinely multipartite entanglement is much less understood than bipartite entanglement, particularly in the context of solving complicated optimization problems using quantum devices. It is thus crucial from both the algorithmic and hardware standpoints to understand whether multipartite entanglement contributes to achieving a good solution. Here, we tackle this challenge by analyzing genuine multipartite entanglement -- quantified by the generalized geometric m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08119","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/2411.08119/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":"2411.08119","created_at":"2026-07-05T10:17:51.492310+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.08119v2","created_at":"2026-07-05T10:17:51.492310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08119","created_at":"2026-07-05T10:17:51.492310+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVYIR7SPZNEV","created_at":"2026-07-05T10:17:51.492310+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVYIR7SPZNEVHJFK","created_at":"2026-07-05T10:17:51.492310+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVYIR7SP","created_at":"2026-07-05T10:17:51.492310+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.04398","citing_title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","ref_index":72,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DVYIR7SPZNEVHJFKOW32E3XHR5","json":"https://pith.science/pith/DVYIR7SPZNEVHJFKOW32E3XHR5.json","graph_json":"https://pith.science/api/pith-number/DVYIR7SPZNEVHJFKOW32E3XHR5/graph.json","events_json":"https://pith.science/api/pith-number/DVYIR7SPZNEVHJFKOW32E3XHR5/events.json","paper":"https://pith.science/paper/DVYIR7SP"},"agent_actions":{"view_html":"https://pith.science/pith/DVYIR7SPZNEVHJFKOW32E3XHR5","download_json":"https://pith.science/pith/DVYIR7SPZNEVHJFKOW32E3XHR5.json","view_paper":"https://pith.science/paper/DVYIR7SP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.08119&json=true","fetch_graph":"https://pith.science/api/pith-number/DVYIR7SPZNEVHJFKOW32E3XHR5/graph.json","fetch_events":"https://pith.science/api/pith-number/DVYIR7SPZNEVHJFKOW32E3XHR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVYIR7SPZNEVHJFKOW32E3XHR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVYIR7SPZNEVHJFKOW32E3XHR5/action/storage_attestation","attest_author":"https://pith.science/pith/DVYIR7SPZNEVHJFKOW32E3XHR5/action/author_attestation","sign_citation":"https://pith.science/pith/DVYIR7SPZNEVHJFKOW32E3XHR5/action/citation_signature","submit_replication":"https://pith.science/pith/DVYIR7SPZNEVHJFKOW32E3XHR5/action/replication_record"}},"created_at":"2026-07-05T10:17:51.492310+00:00","updated_at":"2026-07-05T10:17:51.492310+00:00"}