{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A4IXPXXTMIYIABSXNWR5BJSZAT","short_pith_number":"pith:A4IXPXXT","canonical_record":{"source":{"id":"1406.1433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-05T16:21:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"184e8c4999253325cbd5db98861147539cbf72729fc9e43162928bace775dd96","abstract_canon_sha256":"4ca00f37e750077d095cd722150153ea433f3daf7b6fbba379928ccd40f25f41"},"schema_version":"1.0"},"canonical_sha256":"071177def362308006576da3d0a65904fbde7b986c01daa2478cdf7ea688e747","source":{"kind":"arxiv","id":"1406.1433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1433","created_at":"2026-05-18T02:50:23Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1433v1","created_at":"2026-05-18T02:50:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1433","created_at":"2026-05-18T02:50:23Z"},{"alias_kind":"pith_short_12","alias_value":"A4IXPXXTMIYI","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A4IXPXXTMIYIABSX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A4IXPXXT","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A4IXPXXTMIYIABSXNWR5BJSZAT","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-05T16:21:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"184e8c4999253325cbd5db98861147539cbf72729fc9e43162928bace775dd96","abstract_canon_sha256":"4ca00f37e750077d095cd722150153ea433f3daf7b6fbba379928ccd40f25f41"},"schema_version":"1.0"},"canonical_sha256":"071177def362308006576da3d0a65904fbde7b986c01daa2478cdf7ea688e747","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:23.292857Z","signature_b64":"2V65mu7mtN6Cs1eajUdS2qgbDaQ3u/R9bREW6LxFJ5+iqgQHLRVj9iS02eNXxg343u9VTZAOgTC/L0U1XxwVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"071177def362308006576da3d0a65904fbde7b986c01daa2478cdf7ea688e747","last_reissued_at":"2026-05-18T02:50:23.292257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:23.292257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1433","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-05-18T02:50:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEHfzywwvQSTF4KOkx3R9gAL8BUdnWQEumywwKoXHlhSgMXlkNfPz0Yd7Wwp5YrKkis/81Gbmip+41POY7FkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:20:02.659591Z"},"content_sha256":"bae910991b1be65b380f087f065ca09904370a85b094f82667fb8256b33da81f","schema_version":"1.0","event_id":"sha256:bae910991b1be65b380f087f065ca09904370a85b094f82667fb8256b33da81f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A4IXPXXTMIYIABSXNWR5BJSZAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconfiguring Independent Sets in Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Marthe Bonamy, Nicolas Bousquet","submitted_at":"2014-06-05T16:21:51Z","abstract_excerpt":"Two independent sets of a graph are adjacent if they differ on exactly one vertex (i.e. we can transform one into the other by adding or deleting a vertex). Let $k$ be an integer. We consider the reconfiguration graph $TAR_k(G)$ on the set of independent sets of size at least $k$ in a graph $G$, with the above notion of adjacency. Here we provide a cubic-time algorithm to decide whether $TAR_k(G)$ is connected when $G$ is a cograph, thus solving an open question of~[Bonsma 2014]. As a by-product, we also describe a linear-time algorithm which decides whether two elements of $TAR_k(G)$ are in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1433","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":""},"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-18T02:50:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lNIwW3CBLbGrOJgMX1MYmFxK5uMonifgYWmE0vIhbYE5vV+hKLFHLc5JGw8Qh9Rp9ey02rTrikRVqg5u3zLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:20:02.659956Z"},"content_sha256":"8aa8b80042bd6a136d2336a4da23e7f995ff2b3419925dcb2ed560105445b603","schema_version":"1.0","event_id":"sha256:8aa8b80042bd6a136d2336a4da23e7f995ff2b3419925dcb2ed560105445b603"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4IXPXXTMIYIABSXNWR5BJSZAT/bundle.json","state_url":"https://pith.science/pith/A4IXPXXTMIYIABSXNWR5BJSZAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4IXPXXTMIYIABSXNWR5BJSZAT/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-26T12:20:02Z","links":{"resolver":"https://pith.science/pith/A4IXPXXTMIYIABSXNWR5BJSZAT","bundle":"https://pith.science/pith/A4IXPXXTMIYIABSXNWR5BJSZAT/bundle.json","state":"https://pith.science/pith/A4IXPXXTMIYIABSXNWR5BJSZAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4IXPXXTMIYIABSXNWR5BJSZAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A4IXPXXTMIYIABSXNWR5BJSZAT","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":"4ca00f37e750077d095cd722150153ea433f3daf7b6fbba379928ccd40f25f41","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-05T16:21:51Z","title_canon_sha256":"184e8c4999253325cbd5db98861147539cbf72729fc9e43162928bace775dd96"},"schema_version":"1.0","source":{"id":"1406.1433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1433","created_at":"2026-05-18T02:50:23Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1433v1","created_at":"2026-05-18T02:50:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1433","created_at":"2026-05-18T02:50:23Z"},{"alias_kind":"pith_short_12","alias_value":"A4IXPXXTMIYI","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A4IXPXXTMIYIABSX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A4IXPXXT","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:8aa8b80042bd6a136d2336a4da23e7f995ff2b3419925dcb2ed560105445b603","target":"graph","created_at":"2026-05-18T02:50:23Z","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":"Two independent sets of a graph are adjacent if they differ on exactly one vertex (i.e. we can transform one into the other by adding or deleting a vertex). Let $k$ be an integer. We consider the reconfiguration graph $TAR_k(G)$ on the set of independent sets of size at least $k$ in a graph $G$, with the above notion of adjacency. Here we provide a cubic-time algorithm to decide whether $TAR_k(G)$ is connected when $G$ is a cograph, thus solving an open question of~[Bonsma 2014]. As a by-product, we also describe a linear-time algorithm which decides whether two elements of $TAR_k(G)$ are in t","authors_text":"Marthe Bonamy, Nicolas Bousquet","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-05T16:21:51Z","title":"Reconfiguring Independent Sets in Cographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1433","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:bae910991b1be65b380f087f065ca09904370a85b094f82667fb8256b33da81f","target":"record","created_at":"2026-05-18T02:50:23Z","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":"4ca00f37e750077d095cd722150153ea433f3daf7b6fbba379928ccd40f25f41","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-05T16:21:51Z","title_canon_sha256":"184e8c4999253325cbd5db98861147539cbf72729fc9e43162928bace775dd96"},"schema_version":"1.0","source":{"id":"1406.1433","kind":"arxiv","version":1}},"canonical_sha256":"071177def362308006576da3d0a65904fbde7b986c01daa2478cdf7ea688e747","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"071177def362308006576da3d0a65904fbde7b986c01daa2478cdf7ea688e747","first_computed_at":"2026-05-18T02:50:23.292257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:23.292257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2V65mu7mtN6Cs1eajUdS2qgbDaQ3u/R9bREW6LxFJ5+iqgQHLRVj9iS02eNXxg343u9VTZAOgTC/L0U1XxwVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:23.292857Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bae910991b1be65b380f087f065ca09904370a85b094f82667fb8256b33da81f","sha256:8aa8b80042bd6a136d2336a4da23e7f995ff2b3419925dcb2ed560105445b603"],"state_sha256":"0df6a0abb9f791128374e335859a0a055af43771fdecfea503227eafbf337abf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAahQZNG/0sV20eoudcKTLJEUfGE5Nx876/zp9l/7+cKFdk6BvgZREzzR5e7vahNMmmPNIKYUK0LCx143lscAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:20:02.663960Z","bundle_sha256":"2c76a480a208e82488f43be3de3086516c4309fdf0834b933946417d98906b9f"}}