{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ILLEKAEAQBHR274JMIXYSREOJG","short_pith_number":"pith:ILLEKAEA","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"},"canonical_sha256":"42d6450080804f1d7f89622f89448e499417621362c0a1035fed2286049f682d","source":{"kind":"arxiv","id":"1103.5609","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5609","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5609v1","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5609","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"pith_short_12","alias_value":"ILLEKAEAQBHR","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"ILLEKAEAQBHR274J","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"ILLEKAEA","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ILLEKAEAQBHR274JMIXYSREOJG","target":"record","payload":{"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"},"canonical_sha256":"42d6450080804f1d7f89622f89448e499417621362c0a1035fed2286049f682d","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"},"source_kind":"arxiv","source_id":"1103.5609","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-05-18T04:25:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AXlyibbVI8T4IbgJGdlBOu+Dwtg1z7Qp4IfSXYECI8eVni/qBfY1T/VXuCljUMxFPMcN2SEx4LMld7PHvAJUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:35:29.669771Z"},"content_sha256":"4f04e89b55ebdf2349c807bf8ee20a8d6fc7e87d618fdb246c9bec5dd23587e9","schema_version":"1.0","event_id":"sha256:4f04e89b55ebdf2349c807bf8ee20a8d6fc7e87d618fdb246c9bec5dd23587e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ILLEKAEAQBHR274JMIXYSREOJG","target":"graph","payload":{"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"},"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-05-18T04:25:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwo/SYrGy/BTkWvyvwmFVnK9538pLoSUhsvXlc7BeKCNHkCnqwL/Q3zOsU3t6dsjN66tHFOMEpe0oKmANBbgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:35:29.670123Z"},"content_sha256":"5d8871dcb50c05780630b98dfe104ee93350bf9b99afd10fd41e5306c6b966f5","schema_version":"1.0","event_id":"sha256:5d8871dcb50c05780630b98dfe104ee93350bf9b99afd10fd41e5306c6b966f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG/bundle.json","state_url":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILLEKAEAQBHR274JMIXYSREOJG/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-05-30T05:35:29Z","links":{"resolver":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG","bundle":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG/bundle.json","state":"https://pith.science/pith/ILLEKAEAQBHR274JMIXYSREOJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILLEKAEAQBHR274JMIXYSREOJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ILLEKAEAQBHR274JMIXYSREOJG","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":"eaa848d1511883f38ee6d28cfea73b05e0ee4ba243380af79fc6cdcec74f76f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-29T11:47:04Z","title_canon_sha256":"acc2c7db18a99995b339efcd7d0ad6f2a64acb50165827efa99208920f2201dc"},"schema_version":"1.0","source":{"id":"1103.5609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5609","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5609v1","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5609","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"pith_short_12","alias_value":"ILLEKAEAQBHR","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"ILLEKAEAQBHR274J","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"ILLEKAEA","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:5d8871dcb50c05780630b98dfe104ee93350bf9b99afd10fd41e5306c6b966f5","target":"graph","created_at":"2026-05-18T04:25:37Z","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"},"paper":{"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","authors_text":"Daniel Reichman, Uriel Feige","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-29T11:47:04Z","title":"Recoverable Values for Independent Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5609","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:4f04e89b55ebdf2349c807bf8ee20a8d6fc7e87d618fdb246c9bec5dd23587e9","target":"record","created_at":"2026-05-18T04:25:37Z","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":"eaa848d1511883f38ee6d28cfea73b05e0ee4ba243380af79fc6cdcec74f76f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-29T11:47:04Z","title_canon_sha256":"acc2c7db18a99995b339efcd7d0ad6f2a64acb50165827efa99208920f2201dc"},"schema_version":"1.0","source":{"id":"1103.5609","kind":"arxiv","version":1}},"canonical_sha256":"42d6450080804f1d7f89622f89448e499417621362c0a1035fed2286049f682d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42d6450080804f1d7f89622f89448e499417621362c0a1035fed2286049f682d","first_computed_at":"2026-05-18T04:25:37.241795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:37.241795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jdeC6hUyGI0QYvlrOV8ouP/HDlwWqSBKGRPYowOuje5/DESzProw3s7tgnaKT5O5Qv+VGjG3JiKGLKM8UtwWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:37.242254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f04e89b55ebdf2349c807bf8ee20a8d6fc7e87d618fdb246c9bec5dd23587e9","sha256:5d8871dcb50c05780630b98dfe104ee93350bf9b99afd10fd41e5306c6b966f5"],"state_sha256":"923d1bee06bdaed0eb403284ebed313cee51bd655c765fb44f4840a5dc4b32ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xhHYwfBd6s4PIfsPha/cYQvckVKgrZ2TgwJNkNc3FKQNDjuru5mBpS8U2S2VqjB2nhyleNrsAujiHwb6hh5dAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:35:29.673090Z","bundle_sha256":"d95e8b582f3e35ba5c300fc2cc7b3a5a95ee2b9c77732717aafcf990253dddeb"}}