{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YXSVGPZAQND4NHOYWLZK2PXCAV","short_pith_number":"pith:YXSVGPZA","canonical_record":{"source":{"id":"1211.6656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-28T16:56:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"64f6bc20181d9c4a4515d2397ddbc9779a986cf0232f81aabaa0616b686e7253","abstract_canon_sha256":"cb500eaae1d0fe814e398e291506342f4d65e44d17b0e9ee3678ee5cb5e1d70b"},"schema_version":"1.0"},"canonical_sha256":"c5e5533f208347c69dd8b2f2ad3ee205462932dd976b4e2d806d1fe82d79d690","source":{"kind":"arxiv","id":"1211.6656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6656","created_at":"2026-05-18T03:39:44Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6656v1","created_at":"2026-05-18T03:39:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6656","created_at":"2026-05-18T03:39:44Z"},{"alias_kind":"pith_short_12","alias_value":"YXSVGPZAQND4","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YXSVGPZAQND4NHOY","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YXSVGPZA","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YXSVGPZAQND4NHOYWLZK2PXCAV","target":"record","payload":{"canonical_record":{"source":{"id":"1211.6656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-28T16:56:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"64f6bc20181d9c4a4515d2397ddbc9779a986cf0232f81aabaa0616b686e7253","abstract_canon_sha256":"cb500eaae1d0fe814e398e291506342f4d65e44d17b0e9ee3678ee5cb5e1d70b"},"schema_version":"1.0"},"canonical_sha256":"c5e5533f208347c69dd8b2f2ad3ee205462932dd976b4e2d806d1fe82d79d690","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:44.106449Z","signature_b64":"BQXmr4UvkftRTNlhuS8imVb8383ptN0r3QrT8XqP86jX+U3QEQBMcjywpmui4ei8AfpToTl2BhmTdZSStySODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5e5533f208347c69dd8b2f2ad3ee205462932dd976b4e2d806d1fe82d79d690","last_reissued_at":"2026-05-18T03:39:44.106021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:44.106021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.6656","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-18T03:39:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+XL4C/bnCIKiwF9EEuiSSE2gVZFGaZm96Az1cIrPXMwmQRLOkC3GyctpV37uQci63NYEyljyLbjcEkb3cV/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:43:18.259398Z"},"content_sha256":"a98655ed042eba1f9f10ca5d170f8033bff063a8fa85836c486f07aab31f982b","schema_version":"1.0","event_id":"sha256:a98655ed042eba1f9f10ca5d170f8033bff063a8fa85836c486f07aab31f982b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YXSVGPZAQND4NHOYWLZK2PXCAV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subexponential and FPT-time Inapproximability of Independent Set and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bruno Escoffier, EunJung Kim, Vangelis Th. Paschos","submitted_at":"2012-11-28T16:56:19Z","abstract_excerpt":"Fixed-parameter algorithms, approximation algorithms and moderately exponential algorithms are three major approaches to algorithms design. While each of them being very active in its own, there is an increasing attention to the connection between different approaches. In particular, whether Maximum Independent Set would be better approximable once endowed with subexponential-time or FPT-time is a central question. In this paper, we present a strong link between the linear PCP conjecture and the inapproximability, thus partially answering this question."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6656","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-18T03:39:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9/c8sSHQ/s71/crSK8UouFhR1PxLF+XFPJNiuHmLFENXaeaUmhoKHoN1jF0WC0GDG95GKBIhWZlU+1/6f7mCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:43:18.260074Z"},"content_sha256":"ff379485a78b657cb37f72e3784aff584bf61d42f81861788bcbf5000f39fe61","schema_version":"1.0","event_id":"sha256:ff379485a78b657cb37f72e3784aff584bf61d42f81861788bcbf5000f39fe61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXSVGPZAQND4NHOYWLZK2PXCAV/bundle.json","state_url":"https://pith.science/pith/YXSVGPZAQND4NHOYWLZK2PXCAV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXSVGPZAQND4NHOYWLZK2PXCAV/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-26T01:43:18Z","links":{"resolver":"https://pith.science/pith/YXSVGPZAQND4NHOYWLZK2PXCAV","bundle":"https://pith.science/pith/YXSVGPZAQND4NHOYWLZK2PXCAV/bundle.json","state":"https://pith.science/pith/YXSVGPZAQND4NHOYWLZK2PXCAV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXSVGPZAQND4NHOYWLZK2PXCAV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YXSVGPZAQND4NHOYWLZK2PXCAV","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":"cb500eaae1d0fe814e398e291506342f4d65e44d17b0e9ee3678ee5cb5e1d70b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-28T16:56:19Z","title_canon_sha256":"64f6bc20181d9c4a4515d2397ddbc9779a986cf0232f81aabaa0616b686e7253"},"schema_version":"1.0","source":{"id":"1211.6656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6656","created_at":"2026-05-18T03:39:44Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6656v1","created_at":"2026-05-18T03:39:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6656","created_at":"2026-05-18T03:39:44Z"},{"alias_kind":"pith_short_12","alias_value":"YXSVGPZAQND4","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YXSVGPZAQND4NHOY","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YXSVGPZA","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:ff379485a78b657cb37f72e3784aff584bf61d42f81861788bcbf5000f39fe61","target":"graph","created_at":"2026-05-18T03:39:44Z","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":"Fixed-parameter algorithms, approximation algorithms and moderately exponential algorithms are three major approaches to algorithms design. While each of them being very active in its own, there is an increasing attention to the connection between different approaches. In particular, whether Maximum Independent Set would be better approximable once endowed with subexponential-time or FPT-time is a central question. In this paper, we present a strong link between the linear PCP conjecture and the inapproximability, thus partially answering this question.","authors_text":"Bruno Escoffier, EunJung Kim, Vangelis Th. Paschos","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-28T16:56:19Z","title":"Subexponential and FPT-time Inapproximability of Independent Set and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6656","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:a98655ed042eba1f9f10ca5d170f8033bff063a8fa85836c486f07aab31f982b","target":"record","created_at":"2026-05-18T03:39:44Z","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":"cb500eaae1d0fe814e398e291506342f4d65e44d17b0e9ee3678ee5cb5e1d70b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-28T16:56:19Z","title_canon_sha256":"64f6bc20181d9c4a4515d2397ddbc9779a986cf0232f81aabaa0616b686e7253"},"schema_version":"1.0","source":{"id":"1211.6656","kind":"arxiv","version":1}},"canonical_sha256":"c5e5533f208347c69dd8b2f2ad3ee205462932dd976b4e2d806d1fe82d79d690","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5e5533f208347c69dd8b2f2ad3ee205462932dd976b4e2d806d1fe82d79d690","first_computed_at":"2026-05-18T03:39:44.106021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:44.106021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BQXmr4UvkftRTNlhuS8imVb8383ptN0r3QrT8XqP86jX+U3QEQBMcjywpmui4ei8AfpToTl2BhmTdZSStySODg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:44.106449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a98655ed042eba1f9f10ca5d170f8033bff063a8fa85836c486f07aab31f982b","sha256:ff379485a78b657cb37f72e3784aff584bf61d42f81861788bcbf5000f39fe61"],"state_sha256":"e2e177f72f3ff511a02594ccb41446b1e3e5c99adc4d9f397024aeec48d76759"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swRu93lbiTjW0/1uuwmCOqDGJ+9lI1RZ4hy+Gy3dGKdcu9s/b7ab2sq7bsTMpwfEB2PBu2hRcu0OzO8gaE5MBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:43:18.263913Z","bundle_sha256":"366128c1bc1d896639b1c8de8dc4aa05355abc9a54c6b3cbc14a804a2b0cf772"}}