{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ER76JO7GSE2RE7EZ3FBYVR56SU","short_pith_number":"pith:ER76JO7G","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"},"canonical_sha256":"247fe4bbe69135127c99d9438ac7be952e952ca3064fd73c6945e5475425b0f0","source":{"kind":"arxiv","id":"2407.11364","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.11364","created_at":"2026-07-05T08:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"2407.11364v1","created_at":"2026-07-05T08:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11364","created_at":"2026-07-05T08:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"ER76JO7GSE2R","created_at":"2026-07-05T08:44:23Z"},{"alias_kind":"pith_short_16","alias_value":"ER76JO7GSE2RE7EZ","created_at":"2026-07-05T08:44:23Z"},{"alias_kind":"pith_short_8","alias_value":"ER76JO7G","created_at":"2026-07-05T08:44:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ER76JO7GSE2RE7EZ3FBYVR56SU","target":"record","payload":{"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"},"canonical_sha256":"247fe4bbe69135127c99d9438ac7be952e952ca3064fd73c6945e5475425b0f0","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"},"source_kind":"arxiv","source_id":"2407.11364","source_version":1,"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-05T08:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AJWyHUC062OOOXWQAKC1rbVhS35hJQAeWnQ57x1HZwRY4B8wVe+O75QoSZvEtrM5VeZpFLMKrduI8a2baNuSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T08:59:57.556577Z"},"content_sha256":"3f3bc94ee2cd942ea063d3d3398e926b7ee8486706f276d4ee73ff9bd093f1c1","schema_version":"1.0","event_id":"sha256:3f3bc94ee2cd942ea063d3d3398e926b7ee8486706f276d4ee73ff9bd093f1c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ER76JO7GSE2RE7EZ3FBYVR56SU","target":"graph","payload":{"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"},"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-05T08:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zHfb6D9mXTeEkoLVKAQFyA3+Q0ew1RkjUrSKXl2VglcOyfctPd+npeCaRoB+x7eIzUQhtTz3wRSBKn4nGAUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T08:59:57.556947Z"},"content_sha256":"4c5deabeeade5306a590f70b4b99f7ceaf8c38cabee533a6491c7a9632ab9b6b","schema_version":"1.0","event_id":"sha256:4c5deabeeade5306a590f70b4b99f7ceaf8c38cabee533a6491c7a9632ab9b6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU/bundle.json","state_url":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ER76JO7GSE2RE7EZ3FBYVR56SU/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-07-18T08:59:57Z","links":{"resolver":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU","bundle":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU/bundle.json","state":"https://pith.science/pith/ER76JO7GSE2RE7EZ3FBYVR56SU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ER76JO7GSE2RE7EZ3FBYVR56SU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ER76JO7GSE2RE7EZ3FBYVR56SU","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":"c37a935faa421e18eb522a42914ddc8fc64837b91631f682b8af4f029aa239a9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-16T04:05:40Z","title_canon_sha256":"b43715d9408161a11250509782904b0a0a65688f0624660c7876d06fe74e35bf"},"schema_version":"1.0","source":{"id":"2407.11364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.11364","created_at":"2026-07-05T08:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"2407.11364v1","created_at":"2026-07-05T08:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11364","created_at":"2026-07-05T08:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"ER76JO7GSE2R","created_at":"2026-07-05T08:44:23Z"},{"alias_kind":"pith_short_16","alias_value":"ER76JO7GSE2RE7EZ","created_at":"2026-07-05T08:44:23Z"},{"alias_kind":"pith_short_8","alias_value":"ER76JO7G","created_at":"2026-07-05T08:44:23Z"}],"graph_snapshots":[{"event_id":"sha256:4c5deabeeade5306a590f70b4b99f7ceaf8c38cabee533a6491c7a9632ab9b6b","target":"graph","created_at":"2026-07-05T08:44:23Z","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/2407.11364/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chen Wang, Prathamesh Dharangutte, Vihan Shah, Vladimir Braverman","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-16T04:05:40Z","title":"Learning-augmented Maximum Independent Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.11364","kind":"arxiv","version":1},"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:3f3bc94ee2cd942ea063d3d3398e926b7ee8486706f276d4ee73ff9bd093f1c1","target":"record","created_at":"2026-07-05T08:44:23Z","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":"c37a935faa421e18eb522a42914ddc8fc64837b91631f682b8af4f029aa239a9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-16T04:05:40Z","title_canon_sha256":"b43715d9408161a11250509782904b0a0a65688f0624660c7876d06fe74e35bf"},"schema_version":"1.0","source":{"id":"2407.11364","kind":"arxiv","version":1}},"canonical_sha256":"247fe4bbe69135127c99d9438ac7be952e952ca3064fd73c6945e5475425b0f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"247fe4bbe69135127c99d9438ac7be952e952ca3064fd73c6945e5475425b0f0","first_computed_at":"2026-07-05T08:44:23.098841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:44:23.098841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"byPs79k1qtWiJxdoKCKqrROJYocA097FM+5qAdUlyXfztmAsSjzyX1cikZVoOavIDMxXGIoaUjwx2/IDT9h1Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:44:23.099253Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.11364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f3bc94ee2cd942ea063d3d3398e926b7ee8486706f276d4ee73ff9bd093f1c1","sha256:4c5deabeeade5306a590f70b4b99f7ceaf8c38cabee533a6491c7a9632ab9b6b"],"state_sha256":"164c979df428eab9870dd559477b31b0bc2b0424d2c77cfd60186d174f7b0a0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8859yNZ8+OvJk65w3FMk2GhvVllewSbd7NcjOeWwO3FHpYhBKCEZ91LrHVPYaUxDiNqMpyA9xQdHz0p5ALQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T08:59:57.559586Z","bundle_sha256":"15b1a44e3c5d1892918a8143ac5dbcd5dee761e13355973eb28815b94944d7fa"}}