{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:H2H47JTYE6DRVSGAR7TTUUVD37","short_pith_number":"pith:H2H47JTY","schema_version":"1.0","canonical_sha256":"3e8fcfa67827871ac8c08fe73a52a3dff82418f0fc2a526779b8f54d654e1162","source":{"kind":"arxiv","id":"1308.2617","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.2617","created_at":"2026-05-18T03:15:42.842019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.2617v2","created_at":"2026-05-18T03:15:42.842019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2617","created_at":"2026-05-18T03:15:42.842019+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2H47JTYE6DR","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2H47JTYE6DRVSGA","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2H47JTY","created_at":"2026-05-18T12:27:46.883200+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/H2H47JTYE6DRVSGAR7TTUUVD37","json":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37.json","graph_json":"https://pith.science/api/pith-number/H2H47JTYE6DRVSGAR7TTUUVD37/graph.json","events_json":"https://pith.science/api/pith-number/H2H47JTYE6DRVSGAR7TTUUVD37/events.json","paper":"https://pith.science/paper/H2H47JTY"},"agent_actions":{"view_html":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37","download_json":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37.json","view_paper":"https://pith.science/paper/H2H47JTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.2617&json=true","fetch_graph":"https://pith.science/api/pith-number/H2H47JTYE6DRVSGAR7TTUUVD37/graph.json","fetch_events":"https://pith.science/api/pith-number/H2H47JTYE6DRVSGAR7TTUUVD37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37/action/storage_attestation","attest_author":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37/action/author_attestation","sign_citation":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37/action/citation_signature","submit_replication":"https://pith.science/pith/H2H47JTYE6DRVSGAR7TTUUVD37/action/replication_record"}},"created_at":"2026-05-18T03:15:42.842019+00:00","updated_at":"2026-05-18T03:15:42.842019+00:00"}