{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:H2H47JTYE6DRVSGAR7TTUUVD37","short_pith_number":"pith:H2H47JTY","canonical_record":{"source":{"id":"1308.2617","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-12T16:39:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2ea99bf67cd31a5141ca816dccc905335a46c01b23b973c261d389639fcf7a46","abstract_canon_sha256":"55d95b9ed519042ac27863b30dee9b2032378d47a198260bac3d9b66dcb583fe"},"schema_version":"1.0"},"canonical_sha256":"3e8fcfa67827871ac8c08fe73a52a3dff82418f0fc2a526779b8f54d654e1162","source":{"kind":"arxiv","id":"1308.2617","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2617","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2617v2","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2617","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"H2H47JTYE6DR","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H2H47JTYE6DRVSGA","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H2H47JTY","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:H2H47JTYE6DRVSGAR7TTUUVD37","target":"record","payload":{"canonical_record":{"source":{"id":"1308.2617","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-12T16:39:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2ea99bf67cd31a5141ca816dccc905335a46c01b23b973c261d389639fcf7a46","abstract_canon_sha256":"55d95b9ed519042ac27863b30dee9b2032378d47a198260bac3d9b66dcb583fe"},"schema_version":"1.0"},"canonical_sha256":"3e8fcfa67827871ac8c08fe73a52a3dff82418f0fc2a526779b8f54d654e1162","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:42.842590Z","signature_b64":"08ESWuOrmHMe+Z9IKa56g1lYYQsxJ98DauwKTLec5baBn24LorwUf7YBvwye3LJ0flqWNk6uBjP1mV36Cc6vCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e8fcfa67827871ac8c08fe73a52a3dff82418f0fc2a526779b8f54d654e1162","last_reissued_at":"2026-05-18T03:15:42.841901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:42.841901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.2617","source_version":2,"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:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U0oHPSo4LkIeMyuDSySA+X64ENbqAc9Mof4yDOCS+gOX3G46hmT7dEnu1mDTGpQKN91el5djRUVGAfeG7DmSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:00:10.178188Z"},"content_sha256":"2e01cf383503dbfc1c872d1b1779167deefc7bc15a43e1fd3c4f52bc266c34ac","schema_version":"1.0","event_id":"sha256:2e01cf383503dbfc1c872d1b1779167deefc7bc15a43e1fd3c4f52bc266c34ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:H2H47JTYE6DRVSGAR7TTUUVD37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Parinya Chalermsook","submitted_at":"2013-08-12T16:39:11Z","abstract_excerpt":"We present a series of almost settled inapproximability results for three fundamental problems. The first in our series is the subexponential-time inapproximability of the maximum independent set problem, a question studied in the area of parameterized complexity. The second is the hardness of approximating the maximum induced matching problem on bounded-degree bipartite graphs. The last in our series is the tight hardness of approximating the k-hypergraph pricing problem, a fundamental problem arising from the area of algorithmic game theory. In particular, assuming the Exponential Time Hypot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2617","kind":"arxiv","version":2},"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:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XEnyHA/Yj3I1uRS++CXdDyK1+DmhcbiUUL6Nx09Zxv+J+STEVHBgyv4U/9b65uaw08fSo4uR2T2lVY+lz6J0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:00:10.178595Z"},"content_sha256":"9b57d416c318a1a50cd95ce0a88b09243ce4c01f663f96d4ef043d5e6d90faf8","schema_version":"1.0","event_id":"sha256:9b57d416c318a1a50cd95ce0a88b09243ce4c01f663f96d4ef043d5e6d90faf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37/bundle.json","state_url":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2H47JTYE6DRVSGAR7TTUUVD37/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-25T21:00:10Z","links":{"resolver":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37","bundle":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37/bundle.json","state":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2H47JTYE6DRVSGAR7TTUUVD37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:H2H47JTYE6DRVSGAR7TTUUVD37","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":"55d95b9ed519042ac27863b30dee9b2032378d47a198260bac3d9b66dcb583fe","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-12T16:39:11Z","title_canon_sha256":"2ea99bf67cd31a5141ca816dccc905335a46c01b23b973c261d389639fcf7a46"},"schema_version":"1.0","source":{"id":"1308.2617","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2617","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2617v2","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2617","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"H2H47JTYE6DR","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H2H47JTYE6DRVSGA","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H2H47JTY","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:9b57d416c318a1a50cd95ce0a88b09243ce4c01f663f96d4ef043d5e6d90faf8","target":"graph","created_at":"2026-05-18T03:15:42Z","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":"We present a series of almost settled inapproximability results for three fundamental problems. The first in our series is the subexponential-time inapproximability of the maximum independent set problem, a question studied in the area of parameterized complexity. The second is the hardness of approximating the maximum induced matching problem on bounded-degree bipartite graphs. The last in our series is the tight hardness of approximating the k-hypergraph pricing problem, a fundamental problem arising from the area of algorithmic game theory. In particular, assuming the Exponential Time Hypot","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Parinya Chalermsook","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-12T16:39:11Z","title":"Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2617","kind":"arxiv","version":2},"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:2e01cf383503dbfc1c872d1b1779167deefc7bc15a43e1fd3c4f52bc266c34ac","target":"record","created_at":"2026-05-18T03:15:42Z","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":"55d95b9ed519042ac27863b30dee9b2032378d47a198260bac3d9b66dcb583fe","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-12T16:39:11Z","title_canon_sha256":"2ea99bf67cd31a5141ca816dccc905335a46c01b23b973c261d389639fcf7a46"},"schema_version":"1.0","source":{"id":"1308.2617","kind":"arxiv","version":2}},"canonical_sha256":"3e8fcfa67827871ac8c08fe73a52a3dff82418f0fc2a526779b8f54d654e1162","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e8fcfa67827871ac8c08fe73a52a3dff82418f0fc2a526779b8f54d654e1162","first_computed_at":"2026-05-18T03:15:42.841901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:42.841901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"08ESWuOrmHMe+Z9IKa56g1lYYQsxJ98DauwKTLec5baBn24LorwUf7YBvwye3LJ0flqWNk6uBjP1mV36Cc6vCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:42.842590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2617","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e01cf383503dbfc1c872d1b1779167deefc7bc15a43e1fd3c4f52bc266c34ac","sha256:9b57d416c318a1a50cd95ce0a88b09243ce4c01f663f96d4ef043d5e6d90faf8"],"state_sha256":"252958d30ce07dd4458c0b4a062c3097669fa68c7bf07d614699c630341bb12f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtiaFnN9AYwID9saXQA5mr7e5Xff8ifZhN+ElK8EXed7z7XY9f15tv3MR3QGXCLUn9BrCxzt3ZKfBVvnXUURAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:00:10.181936Z","bundle_sha256":"808e0789fab9da2ec2b49d437c5648448e38c33cdff86a970cf310c01784f499"}}