{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VM4AEIEJPBH2CKV5CFCSFM4ZIF","short_pith_number":"pith:VM4AEIEJ","schema_version":"1.0","canonical_sha256":"ab38022089784fa12abd114522b3994145cb0f8a04a54d897f8f7dbef3e574e7","source":{"kind":"arxiv","id":"2506.03319","version":1},"attestation_state":"computed","paper":{"title":"A Linear Kernel for Independent Set Reconfiguration in Planar Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Daniel W. Cranston, Nicolas Bousquet","submitted_at":"2025-06-03T19:06:30Z","abstract_excerpt":"Fix a positive integer $r$, and a graph $G$ that is $K_{3,r}$-minor-free. Let $I_s$ and $I_t$ be two independent sets in $G$, each of size $k$. We begin with a ``token'' on each vertex of $I_s$ and seek to move all tokens to $I_t$, by repeated ``token jumping'', removing a single token from one vertex and placing it on another vertex. We require that each intermediate arrangement of tokens again specifies an independent set of size $k$. Given $G$, $I_s$, and $I_t$, we ask whether there exists a sequence of token jumps that transforms $I_s$ into $I_t$. When $k$ is part of the input, this proble"},"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":"2506.03319","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T19:06:30Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"856fef8dfcb72e858affa7822d3282d8f5d89d227d7aad0321fabbb7b83b97e3","abstract_canon_sha256":"86ee03945b0d735375bb1eceaadd92d920184263fcb4c8be127fe70e4a69aebf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:24.998369Z","signature_b64":"B78TFAh0W6vA+feZe2vLRSO3Z8Q6K3wpcgnwJed3/MnUa1gwnj46cp2RhpXNpTy+wCyUQXxEFD/tw+8a+YaWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab38022089784fa12abd114522b3994145cb0f8a04a54d897f8f7dbef3e574e7","last_reissued_at":"2026-07-05T11:15:24.997793Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:24.997793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linear Kernel for Independent Set Reconfiguration in Planar Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Daniel W. Cranston, Nicolas Bousquet","submitted_at":"2025-06-03T19:06:30Z","abstract_excerpt":"Fix a positive integer $r$, and a graph $G$ that is $K_{3,r}$-minor-free. Let $I_s$ and $I_t$ be two independent sets in $G$, each of size $k$. We begin with a ``token'' on each vertex of $I_s$ and seek to move all tokens to $I_t$, by repeated ``token jumping'', removing a single token from one vertex and placing it on another vertex. We require that each intermediate arrangement of tokens again specifies an independent set of size $k$. Given $G$, $I_s$, and $I_t$, we ask whether there exists a sequence of token jumps that transforms $I_s$ into $I_t$. When $k$ is part of the input, this proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03319","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/2506.03319/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":"2506.03319","created_at":"2026-07-05T11:15:24.997856+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03319v1","created_at":"2026-07-05T11:15:24.997856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03319","created_at":"2026-07-05T11:15:24.997856+00:00"},{"alias_kind":"pith_short_12","alias_value":"VM4AEIEJPBH2","created_at":"2026-07-05T11:15:24.997856+00:00"},{"alias_kind":"pith_short_16","alias_value":"VM4AEIEJPBH2CKV5","created_at":"2026-07-05T11:15:24.997856+00:00"},{"alias_kind":"pith_short_8","alias_value":"VM4AEIEJ","created_at":"2026-07-05T11:15:24.997856+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/VM4AEIEJPBH2CKV5CFCSFM4ZIF","json":"https://pith.science/pith/VM4AEIEJPBH2CKV5CFCSFM4ZIF.json","graph_json":"https://pith.science/api/pith-number/VM4AEIEJPBH2CKV5CFCSFM4ZIF/graph.json","events_json":"https://pith.science/api/pith-number/VM4AEIEJPBH2CKV5CFCSFM4ZIF/events.json","paper":"https://pith.science/paper/VM4AEIEJ"},"agent_actions":{"view_html":"https://pith.science/pith/VM4AEIEJPBH2CKV5CFCSFM4ZIF","download_json":"https://pith.science/pith/VM4AEIEJPBH2CKV5CFCSFM4ZIF.json","view_paper":"https://pith.science/paper/VM4AEIEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03319&json=true","fetch_graph":"https://pith.science/api/pith-number/VM4AEIEJPBH2CKV5CFCSFM4ZIF/graph.json","fetch_events":"https://pith.science/api/pith-number/VM4AEIEJPBH2CKV5CFCSFM4ZIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VM4AEIEJPBH2CKV5CFCSFM4ZIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VM4AEIEJPBH2CKV5CFCSFM4ZIF/action/storage_attestation","attest_author":"https://pith.science/pith/VM4AEIEJPBH2CKV5CFCSFM4ZIF/action/author_attestation","sign_citation":"https://pith.science/pith/VM4AEIEJPBH2CKV5CFCSFM4ZIF/action/citation_signature","submit_replication":"https://pith.science/pith/VM4AEIEJPBH2CKV5CFCSFM4ZIF/action/replication_record"}},"created_at":"2026-07-05T11:15:24.997856+00:00","updated_at":"2026-07-05T11:15:24.997856+00:00"}