{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3SFD6SMCVPHHHRNNGLO3WUJC2T","short_pith_number":"pith:3SFD6SMC","schema_version":"1.0","canonical_sha256":"dc8a3f4982abce73c5ad32ddbb5122d4c4a209871510fe79e105b221e47e9d14","source":{"kind":"arxiv","id":"1403.0359","version":1},"attestation_state":"computed","paper":{"title":"Reconfiguring Independent Sets in Claw-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Marcin Kami\\'nski, Marcin Wrochna, Paul Bonsma","submitted_at":"2014-03-03T10:01:08Z","abstract_excerpt":"We present a polynomial-time algorithm that, given two independent sets in a claw-free graph $G$, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex $v$ from the current independent set $S$ and to add a new vertex $w$ (not in $S$) such that the result is again an independent set. We also consider the more restricted model where $v$ and $w$ have to be adjacent."},"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":"1403.0359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-03T10:01:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f7127b476676cce84978295294e405adbfecbcea2f1e9efe9728a3d48b4bee65","abstract_canon_sha256":"9ff6c450d9193374b094a32a9191acbf6a203d6df34c074586039890b826f3b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:25.098099Z","signature_b64":"As8VOukqDo4dpwFRlY0oM5MTGkjChRjYNL2OagGUAlt6YcErW6+qh+3qHSmot+6P52lr2n03YV/mJZvT7xsSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc8a3f4982abce73c5ad32ddbb5122d4c4a209871510fe79e105b221e47e9d14","last_reissued_at":"2026-05-18T02:57:25.097598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:25.097598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconfiguring Independent Sets in Claw-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Marcin Kami\\'nski, Marcin Wrochna, Paul Bonsma","submitted_at":"2014-03-03T10:01:08Z","abstract_excerpt":"We present a polynomial-time algorithm that, given two independent sets in a claw-free graph $G$, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex $v$ from the current independent set $S$ and to add a new vertex $w$ (not in $S$) such that the result is again an independent set. We also consider the more restricted model where $v$ and $w$ have to be adjacent."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0359","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.0359","created_at":"2026-05-18T02:57:25.097672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0359v1","created_at":"2026-05-18T02:57:25.097672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0359","created_at":"2026-05-18T02:57:25.097672+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SFD6SMCVPHH","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SFD6SMCVPHHHRNN","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SFD6SMC","created_at":"2026-05-18T12:28:11.866339+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/3SFD6SMCVPHHHRNNGLO3WUJC2T","json":"https://pith.science/pith/3SFD6SMCVPHHHRNNGLO3WUJC2T.json","graph_json":"https://pith.science/api/pith-number/3SFD6SMCVPHHHRNNGLO3WUJC2T/graph.json","events_json":"https://pith.science/api/pith-number/3SFD6SMCVPHHHRNNGLO3WUJC2T/events.json","paper":"https://pith.science/paper/3SFD6SMC"},"agent_actions":{"view_html":"https://pith.science/pith/3SFD6SMCVPHHHRNNGLO3WUJC2T","download_json":"https://pith.science/pith/3SFD6SMCVPHHHRNNGLO3WUJC2T.json","view_paper":"https://pith.science/paper/3SFD6SMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0359&json=true","fetch_graph":"https://pith.science/api/pith-number/3SFD6SMCVPHHHRNNGLO3WUJC2T/graph.json","fetch_events":"https://pith.science/api/pith-number/3SFD6SMCVPHHHRNNGLO3WUJC2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SFD6SMCVPHHHRNNGLO3WUJC2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SFD6SMCVPHHHRNNGLO3WUJC2T/action/storage_attestation","attest_author":"https://pith.science/pith/3SFD6SMCVPHHHRNNGLO3WUJC2T/action/author_attestation","sign_citation":"https://pith.science/pith/3SFD6SMCVPHHHRNNGLO3WUJC2T/action/citation_signature","submit_replication":"https://pith.science/pith/3SFD6SMCVPHHHRNNGLO3WUJC2T/action/replication_record"}},"created_at":"2026-05-18T02:57:25.097672+00:00","updated_at":"2026-05-18T02:57:25.097672+00:00"}