{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3DQXPH5T66UXQD54PHLTI4CFAY","short_pith_number":"pith:3DQXPH5T","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"},"canonical_sha256":"d8e1779fb3f7a9780fbc79d734704506064abda181385b8069d04e4f6e0a69b4","source":{"kind":"arxiv","id":"2607.00244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00244","created_at":"2026-07-02T00:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00244v1","created_at":"2026-07-02T00:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00244","created_at":"2026-07-02T00:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"3DQXPH5T66UX","created_at":"2026-07-02T00:18:40Z"},{"alias_kind":"pith_short_16","alias_value":"3DQXPH5T66UXQD54","created_at":"2026-07-02T00:18:40Z"},{"alias_kind":"pith_short_8","alias_value":"3DQXPH5T","created_at":"2026-07-02T00:18:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3DQXPH5T66UXQD54PHLTI4CFAY","target":"record","payload":{"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"},"canonical_sha256":"d8e1779fb3f7a9780fbc79d734704506064abda181385b8069d04e4f6e0a69b4","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"},"source_kind":"arxiv","source_id":"2607.00244","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-07-02T00:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/+GsTqjQ93YcKdEz9BiXs1Gk4+QeElw29zjchlPUZSvCfTqs7CHUdVJ05hJfgV3acMjoOXEZDOHiBItnu1nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T12:07:33.924296Z"},"content_sha256":"1db85b6df470f59cc7e34eef3975dfa3d4c1bd69c315119396567c45abd0665c","schema_version":"1.0","event_id":"sha256:1db85b6df470f59cc7e34eef3975dfa3d4c1bd69c315119396567c45abd0665c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3DQXPH5T66UXQD54PHLTI4CFAY","target":"graph","payload":{"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"},"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-07-02T00:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FntdDZyN+J4qKJO8puxpP5G/islHgRMW9wl+OzayDNEhM5S0ATsNMI+joq4LsZD0mguk/nDrxG6ACQfFij91Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T12:07:33.924687Z"},"content_sha256":"a985bedca1508844c8bf34509c96671f4114582bf88d22b3e04a2112a2307300","schema_version":"1.0","event_id":"sha256:a985bedca1508844c8bf34509c96671f4114582bf88d22b3e04a2112a2307300"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY/bundle.json","state_url":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DQXPH5T66UXQD54PHLTI4CFAY/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-07-04T12:07:33Z","links":{"resolver":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY","bundle":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY/bundle.json","state":"https://pith.science/pith/3DQXPH5T66UXQD54PHLTI4CFAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DQXPH5T66UXQD54PHLTI4CFAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3DQXPH5T66UXQD54PHLTI4CFAY","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":"853ca7927cd47db1829dc5d71b77fefaf648f1c5b913eea67d516b466a57954d","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-30T22:43:46Z","title_canon_sha256":"ced78a4f1094ce959835b6e285a32feb57e6b77347732bed707038d34eb82cb3"},"schema_version":"1.0","source":{"id":"2607.00244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00244","created_at":"2026-07-02T00:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00244v1","created_at":"2026-07-02T00:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00244","created_at":"2026-07-02T00:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"3DQXPH5T66UX","created_at":"2026-07-02T00:18:40Z"},{"alias_kind":"pith_short_16","alias_value":"3DQXPH5T66UXQD54","created_at":"2026-07-02T00:18:40Z"},{"alias_kind":"pith_short_8","alias_value":"3DQXPH5T","created_at":"2026-07-02T00:18:40Z"}],"graph_snapshots":[{"event_id":"sha256:a985bedca1508844c8bf34509c96671f4114582bf88d22b3e04a2112a2307300","target":"graph","created_at":"2026-07-02T00:18:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00244/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"\\'Edouard Bonnet, Julien Duron, Ma\\\"el Dumas","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-30T22:43:46Z","title":"Independent Set Hardness in Graphs of Bounded Twin-Width and Low-Radius Merge-Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00244","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:1db85b6df470f59cc7e34eef3975dfa3d4c1bd69c315119396567c45abd0665c","target":"record","created_at":"2026-07-02T00:18:40Z","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":"853ca7927cd47db1829dc5d71b77fefaf648f1c5b913eea67d516b466a57954d","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-30T22:43:46Z","title_canon_sha256":"ced78a4f1094ce959835b6e285a32feb57e6b77347732bed707038d34eb82cb3"},"schema_version":"1.0","source":{"id":"2607.00244","kind":"arxiv","version":1}},"canonical_sha256":"d8e1779fb3f7a9780fbc79d734704506064abda181385b8069d04e4f6e0a69b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8e1779fb3f7a9780fbc79d734704506064abda181385b8069d04e4f6e0a69b4","first_computed_at":"2026-07-02T00:18:40.816923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T00:18:40.816923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bPxiDpdTcmTQ5OYmw8Nbh+P5FG/+l/eBvDv6sj51K2/xCu9br7tukM5bqQO5aZe2K/yrsrxLvLQ13Jy8VWjbAA==","signature_status":"signed_v1","signed_at":"2026-07-02T00:18:40.817699Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1db85b6df470f59cc7e34eef3975dfa3d4c1bd69c315119396567c45abd0665c","sha256:a985bedca1508844c8bf34509c96671f4114582bf88d22b3e04a2112a2307300"],"state_sha256":"2dbdc65744df9291024aff4cec7619bf5b305a74945955c677e0e190ecdb7002"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+qFoKYikceiwcV+hatnR+Ut45/g4ALy7P2A8wc2v95iaWZ14fWXtbZ5GVcckLqUx7kosP3rvOUbdEZua9+TBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T12:07:33.926635Z","bundle_sha256":"1cb7c7acdbb04223f9cb2d115a341e5a991cc5e6d2df4f0c436dce3e5ef44e21"}}