{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3DQXPH5T66UXQD54PHLTI4CFAY","short_pith_number":"pith:3DQXPH5T","schema_version":"1.0","canonical_sha256":"d8e1779fb3f7a9780fbc79d734704506064abda181385b8069d04e4f6e0a69b4","source":{"kind":"arxiv","id":"2607.00244","version":1},"attestation_state":"computed","paper":{"title":"Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"\\'Edouard Bonnet, Julien Duron, Ma\\\"el Dumas","submitted_at":"2026-06-30T22:43:46Z","abstract_excerpt":"For every $\\varepsilon > 0$, Max Independent Set admits a polynomial-time $n^\\varepsilon$-approximation algorithm on $n$-vertex graphs of effectively bounded twin-width [Berg\\'e et al., STACS '23]. The approximation factor actually obtained is more precisely $n^{O(1/ \\log \\log n)}$. Prior to the current paper, no approximation hardness was known for this problem, and the existence of a polynomial-time approximation scheme (PTAS) was repeatedly raised as an open question. We answer this question in a strong sense: We show that there is a constant $\\gamma > 0$ such that a polynomial-time $n^{\\ga"},"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":"2607.00244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-30T22:43:46Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"ced78a4f1094ce959835b6e285a32feb57e6b77347732bed707038d34eb82cb3","abstract_canon_sha256":"853ca7927cd47db1829dc5d71b77fefaf648f1c5b913eea67d516b466a57954d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T00:18:40.817699Z","signature_b64":"bPxiDpdTcmTQ5OYmw8Nbh+P5FG/+l/eBvDv6sj51K2/xCu9br7tukM5bqQO5aZe2K/yrsrxLvLQ13Jy8VWjbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8e1779fb3f7a9780fbc79d734704506064abda181385b8069d04e4f6e0a69b4","last_reissued_at":"2026-07-02T00:18:40.816923Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T00:18:40.816923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"\\'Edouard Bonnet, Julien Duron, Ma\\\"el Dumas","submitted_at":"2026-06-30T22:43:46Z","abstract_excerpt":"For every $\\varepsilon > 0$, Max Independent Set admits a polynomial-time $n^\\varepsilon$-approximation algorithm on $n$-vertex graphs of effectively bounded twin-width [Berg\\'e et al., STACS '23]. The approximation factor actually obtained is more precisely $n^{O(1/ \\log \\log n)}$. Prior to the current paper, no approximation hardness was known for this problem, and the existence of a polynomial-time approximation scheme (PTAS) was repeatedly raised as an open question. We answer this question in a strong sense: We show that there is a constant $\\gamma > 0$ such that a polynomial-time $n^{\\ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00244","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.00244/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.00244","created_at":"2026-07-02T00:18:40.817060+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.00244v1","created_at":"2026-07-02T00:18:40.817060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00244","created_at":"2026-07-02T00:18:40.817060+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DQXPH5T66UX","created_at":"2026-07-02T00:18:40.817060+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DQXPH5T66UXQD54","created_at":"2026-07-02T00:18:40.817060+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DQXPH5T","created_at":"2026-07-02T00:18:40.817060+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/3DQXPH5T66UXQD54PHLTI4CFAY","json":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY.json","graph_json":"https://pith.science/api/pith-number/3DQXPH5T66UXQD54PHLTI4CFAY/graph.json","events_json":"https://pith.science/api/pith-number/3DQXPH5T66UXQD54PHLTI4CFAY/events.json","paper":"https://pith.science/paper/3DQXPH5T"},"agent_actions":{"view_html":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY","download_json":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY.json","view_paper":"https://pith.science/paper/3DQXPH5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.00244&json=true","fetch_graph":"https://pith.science/api/pith-number/3DQXPH5T66UXQD54PHLTI4CFAY/graph.json","fetch_events":"https://pith.science/api/pith-number/3DQXPH5T66UXQD54PHLTI4CFAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY/action/storage_attestation","attest_author":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY/action/author_attestation","sign_citation":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY/action/citation_signature","submit_replication":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY/action/replication_record"}},"created_at":"2026-07-02T00:18:40.817060+00:00","updated_at":"2026-07-02T00:18:40.817060+00:00"}