{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ER76JO7GSE2RE7EZ3FBYVR56SU","short_pith_number":"pith:ER76JO7G","schema_version":"1.0","canonical_sha256":"247fe4bbe69135127c99d9438ac7be952e952ca3064fd73c6945e5475425b0f0","source":{"kind":"arxiv","id":"2407.11364","version":1},"attestation_state":"computed","paper":{"title":"Learning-augmented Maximum Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Chen Wang, Prathamesh Dharangutte, Vihan Shah, Vladimir Braverman","submitted_at":"2024-07-16T04:05:40Z","abstract_excerpt":"We study the Maximum Independent Set (MIS) problem on general graphs within the framework of learning-augmented algorithms. The MIS problem is known to be NP-hard and is also NP-hard to approximate to within a factor of $n^{1-\\delta}$ for any $\\delta>0$. We show that we can break this barrier in the presence of an oracle obtained through predictions from a machine learning model that answers vertex membership queries for a fixed MIS with probability $1/2+\\varepsilon$. In the first setting we consider, the oracle can be queried once per vertex to know if a vertex belongs to a fixed MIS, and the"},"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":"2407.11364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-16T04:05:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b43715d9408161a11250509782904b0a0a65688f0624660c7876d06fe74e35bf","abstract_canon_sha256":"c37a935faa421e18eb522a42914ddc8fc64837b91631f682b8af4f029aa239a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:44:23.099253Z","signature_b64":"byPs79k1qtWiJxdoKCKqrROJYocA097FM+5qAdUlyXfztmAsSjzyX1cikZVoOavIDMxXGIoaUjwx2/IDT9h1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"247fe4bbe69135127c99d9438ac7be952e952ca3064fd73c6945e5475425b0f0","last_reissued_at":"2026-07-05T08:44:23.098841Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:44:23.098841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning-augmented Maximum Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Chen Wang, Prathamesh Dharangutte, Vihan Shah, Vladimir Braverman","submitted_at":"2024-07-16T04:05:40Z","abstract_excerpt":"We study the Maximum Independent Set (MIS) problem on general graphs within the framework of learning-augmented algorithms. The MIS problem is known to be NP-hard and is also NP-hard to approximate to within a factor of $n^{1-\\delta}$ for any $\\delta>0$. We show that we can break this barrier in the presence of an oracle obtained through predictions from a machine learning model that answers vertex membership queries for a fixed MIS with probability $1/2+\\varepsilon$. In the first setting we consider, the oracle can be queried once per vertex to know if a vertex belongs to a fixed MIS, and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.11364","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/2407.11364/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":"2407.11364","created_at":"2026-07-05T08:44:23.098903+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.11364v1","created_at":"2026-07-05T08:44:23.098903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11364","created_at":"2026-07-05T08:44:23.098903+00:00"},{"alias_kind":"pith_short_12","alias_value":"ER76JO7GSE2R","created_at":"2026-07-05T08:44:23.098903+00:00"},{"alias_kind":"pith_short_16","alias_value":"ER76JO7GSE2RE7EZ","created_at":"2026-07-05T08:44:23.098903+00:00"},{"alias_kind":"pith_short_8","alias_value":"ER76JO7G","created_at":"2026-07-05T08:44:23.098903+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/ER76JO7GSE2RE7EZ3FBYVR56SU","json":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU.json","graph_json":"https://pith.science/api/pith-number/ER76JO7GSE2RE7EZ3FBYVR56SU/graph.json","events_json":"https://pith.science/api/pith-number/ER76JO7GSE2RE7EZ3FBYVR56SU/events.json","paper":"https://pith.science/paper/ER76JO7G"},"agent_actions":{"view_html":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU","download_json":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU.json","view_paper":"https://pith.science/paper/ER76JO7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.11364&json=true","fetch_graph":"https://pith.science/api/pith-number/ER76JO7GSE2RE7EZ3FBYVR56SU/graph.json","fetch_events":"https://pith.science/api/pith-number/ER76JO7GSE2RE7EZ3FBYVR56SU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU/action/storage_attestation","attest_author":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU/action/author_attestation","sign_citation":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU/action/citation_signature","submit_replication":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU/action/replication_record"}},"created_at":"2026-07-05T08:44:23.098903+00:00","updated_at":"2026-07-05T08:44:23.098903+00:00"}