{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NAQY3HJK6XW4JPTWNXIKT34GZJ","short_pith_number":"pith:NAQY3HJK","schema_version":"1.0","canonical_sha256":"68218d9d2af5edc4be766dd0a9ef86ca543b5ae6ff2f14053a0e02a942aa99ab","source":{"kind":"arxiv","id":"2503.12551","version":2},"attestation_state":"computed","paper":{"title":"qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.quant-gas","math.OC"],"primary_cat":"quant-ph","authors_text":"Atithi Acharya, Grant Salton, Helmut G. Katzgraber, Marco Pistoia, Martin J. A. Schuetz, Romina Yalovetzky, Ruben S. Andrist, Rudy Raymond, Ruslan Shaydulin, Shouvanik Chakrabarti, Yue Sun","submitted_at":"2025-03-16T15:41:42Z","abstract_excerpt":"We propose and implement a quantum-informed reduction algorithm for the maximum independent set problem that integrates classical kernelization techniques with information extracted from quantum devices. Our larger framework consists of dedicated application, algorithm, and hardware layers, and easily generalizes to the maximum weight independent set problem. In this hybrid quantum-classical framework, which we call qReduMIS, the quantum computer is used as a co-processor to inform classical reduction logic about frozen vertices that are likely (or unlikely) to be in large independent sets, th"},"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":"2503.12551","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-16T15:41:42Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.quant-gas","math.OC"],"title_canon_sha256":"ab37d6fbccb20357bbd4bc487deca7bcbeac6e3436b29f79ed766cbd4c7835a1","abstract_canon_sha256":"0246561f621032e0f5e92e6845fb103957194ef75d5fc62bda95dda9f2f7dd80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T00:16:49.540365Z","signature_b64":"CJcgKbmETM1F2LNBlLfdVjHNjGrh571nnZYIiS0vTHTN8jKPb6lNlw5kcx8+7GO2XA+5oTvMTxEcQkKE1f/vDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68218d9d2af5edc4be766dd0a9ef86ca543b5ae6ff2f14053a0e02a942aa99ab","last_reissued_at":"2026-07-03T00:16:49.539876Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T00:16:49.539876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.quant-gas","math.OC"],"primary_cat":"quant-ph","authors_text":"Atithi Acharya, Grant Salton, Helmut G. Katzgraber, Marco Pistoia, Martin J. A. Schuetz, Romina Yalovetzky, Ruben S. Andrist, Rudy Raymond, Ruslan Shaydulin, Shouvanik Chakrabarti, Yue Sun","submitted_at":"2025-03-16T15:41:42Z","abstract_excerpt":"We propose and implement a quantum-informed reduction algorithm for the maximum independent set problem that integrates classical kernelization techniques with information extracted from quantum devices. Our larger framework consists of dedicated application, algorithm, and hardware layers, and easily generalizes to the maximum weight independent set problem. In this hybrid quantum-classical framework, which we call qReduMIS, the quantum computer is used as a co-processor to inform classical reduction logic about frozen vertices that are likely (or unlikely) to be in large independent sets, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.12551","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/2503.12551/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":"2503.12551","created_at":"2026-07-03T00:16:49.539934+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.12551v2","created_at":"2026-07-03T00:16:49.539934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.12551","created_at":"2026-07-03T00:16:49.539934+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAQY3HJK6XW4","created_at":"2026-07-03T00:16:49.539934+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAQY3HJK6XW4JPTW","created_at":"2026-07-03T00:16:49.539934+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAQY3HJK","created_at":"2026-07-03T00:16:49.539934+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2606.28866","citing_title":"Quantum Variational Approaches to the Maximum Independent Set Problem at Utility Scale","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2607.01037","citing_title":"Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2606.28866","citing_title":"Quantum Variational Approaches to the Maximum Independent Set Problem at Utility Scale","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2503.17115","citing_title":"A quantum wire approach to weighted combinatorial graph optimisation problems","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07952","citing_title":"Reducibility of native weighted graphs on Rydberg Arrays","ref_index":75,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NAQY3HJK6XW4JPTWNXIKT34GZJ","json":"https://pith.science/pith/NAQY3HJK6XW4JPTWNXIKT34GZJ.json","graph_json":"https://pith.science/api/pith-number/NAQY3HJK6XW4JPTWNXIKT34GZJ/graph.json","events_json":"https://pith.science/api/pith-number/NAQY3HJK6XW4JPTWNXIKT34GZJ/events.json","paper":"https://pith.science/paper/NAQY3HJK"},"agent_actions":{"view_html":"https://pith.science/pith/NAQY3HJK6XW4JPTWNXIKT34GZJ","download_json":"https://pith.science/pith/NAQY3HJK6XW4JPTWNXIKT34GZJ.json","view_paper":"https://pith.science/paper/NAQY3HJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.12551&json=true","fetch_graph":"https://pith.science/api/pith-number/NAQY3HJK6XW4JPTWNXIKT34GZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NAQY3HJK6XW4JPTWNXIKT34GZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAQY3HJK6XW4JPTWNXIKT34GZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAQY3HJK6XW4JPTWNXIKT34GZJ/action/storage_attestation","attest_author":"https://pith.science/pith/NAQY3HJK6XW4JPTWNXIKT34GZJ/action/author_attestation","sign_citation":"https://pith.science/pith/NAQY3HJK6XW4JPTWNXIKT34GZJ/action/citation_signature","submit_replication":"https://pith.science/pith/NAQY3HJK6XW4JPTWNXIKT34GZJ/action/replication_record"}},"created_at":"2026-07-03T00:16:49.539934+00:00","updated_at":"2026-07-03T00:16:49.539934+00:00"}