{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ILLEKAEAQBHR274JMIXYSREOJG","short_pith_number":"pith:ILLEKAEA","schema_version":"1.0","canonical_sha256":"42d6450080804f1d7f89622f89448e499417621362c0a1035fed2286049f682d","source":{"kind":"arxiv","id":"1103.5609","version":1},"attestation_state":"computed","paper":{"title":"Recoverable Values for Independent Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Reichman, Uriel Feige","submitted_at":"2011-03-29T11:47:04Z","abstract_excerpt":"The notion of {\\em recoverable value} was advocated in work of Feige, Immorlica, Mirrokni and Nazerzadeh [Approx 2009] as a measure of quality for approximation algorithms. There this concept was applied to facility location problems. In the current work we apply a similar framework to the maximum independent set problem (MIS). We say that an approximation algorithm has {\\em recoverable value} $\\rho$, if for every graph it recovers an independent set of size at least $\\max_I \\sum_{v\\in I} \\min[1,\\rho/(d(v) + 1)]$, where $d(v)$ is the degree of vertex $v$, and $I$ ranges over all independent se"},"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":"1103.5609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-29T11:47:04Z","cross_cats_sorted":[],"title_canon_sha256":"acc2c7db18a99995b339efcd7d0ad6f2a64acb50165827efa99208920f2201dc","abstract_canon_sha256":"eaa848d1511883f38ee6d28cfea73b05e0ee4ba243380af79fc6cdcec74f76f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:37.242254Z","signature_b64":"jdeC6hUyGI0QYvlrOV8ouP/HDlwWqSBKGRPYowOuje5/DESzProw3s7tgnaKT5O5Qv+VGjG3JiKGLKM8UtwWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42d6450080804f1d7f89622f89448e499417621362c0a1035fed2286049f682d","last_reissued_at":"2026-05-18T04:25:37.241795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:37.241795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recoverable Values for Independent Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Reichman, Uriel Feige","submitted_at":"2011-03-29T11:47:04Z","abstract_excerpt":"The notion of {\\em recoverable value} was advocated in work of Feige, Immorlica, Mirrokni and Nazerzadeh [Approx 2009] as a measure of quality for approximation algorithms. There this concept was applied to facility location problems. In the current work we apply a similar framework to the maximum independent set problem (MIS). We say that an approximation algorithm has {\\em recoverable value} $\\rho$, if for every graph it recovers an independent set of size at least $\\max_I \\sum_{v\\in I} \\min[1,\\rho/(d(v) + 1)]$, where $d(v)$ is the degree of vertex $v$, and $I$ ranges over all independent se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5609","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":""},"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":"1103.5609","created_at":"2026-05-18T04:25:37.241867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5609v1","created_at":"2026-05-18T04:25:37.241867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5609","created_at":"2026-05-18T04:25:37.241867+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILLEKAEAQBHR","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILLEKAEAQBHR274J","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILLEKAEA","created_at":"2026-05-18T12:26:32.869790+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/ILLEKAEAQBHR274JMIXYSREOJG","json":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG.json","graph_json":"https://pith.science/api/pith-number/ILLEKAEAQBHR274JMIXYSREOJG/graph.json","events_json":"https://pith.science/api/pith-number/ILLEKAEAQBHR274JMIXYSREOJG/events.json","paper":"https://pith.science/paper/ILLEKAEA"},"agent_actions":{"view_html":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG","download_json":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG.json","view_paper":"https://pith.science/paper/ILLEKAEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5609&json=true","fetch_graph":"https://pith.science/api/pith-number/ILLEKAEAQBHR274JMIXYSREOJG/graph.json","fetch_events":"https://pith.science/api/pith-number/ILLEKAEAQBHR274JMIXYSREOJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG/action/storage_attestation","attest_author":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG/action/author_attestation","sign_citation":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG/action/citation_signature","submit_replication":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG/action/replication_record"}},"created_at":"2026-05-18T04:25:37.241867+00:00","updated_at":"2026-05-18T04:25:37.241867+00:00"}