{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KG42XRDISTREXSIKQNRHIQGMM2","short_pith_number":"pith:KG42XRDI","canonical_record":{"source":{"id":"1705.00429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-01T07:18:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"390880e4da4f3b8b33a6f0613b2f53469d37f301f8abd4ff95685a0411365e4d","abstract_canon_sha256":"c06f34f4a308a6ac2036a93d7e5d13d01a1853e744e27e81c32e57bb552e87b5"},"schema_version":"1.0"},"canonical_sha256":"51b9abc46894e24bc90a83627440cc6685a732aa7c55b3f600d0b7fd842f90c4","source":{"kind":"arxiv","id":"1705.00429","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00429","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00429v2","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00429","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"KG42XRDISTRE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KG42XRDISTREXSIK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KG42XRDI","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KG42XRDISTREXSIKQNRHIQGMM2","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-01T07:18:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"390880e4da4f3b8b33a6f0613b2f53469d37f301f8abd4ff95685a0411365e4d","abstract_canon_sha256":"c06f34f4a308a6ac2036a93d7e5d13d01a1853e744e27e81c32e57bb552e87b5"},"schema_version":"1.0"},"canonical_sha256":"51b9abc46894e24bc90a83627440cc6685a732aa7c55b3f600d0b7fd842f90c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:49.034067Z","signature_b64":"CLKE3FQerPDQGjb7eUdyagZHtk7RshURpxzqLBRLEqcpRdzj6iaS3wnEJpAYU7o5RC6RpwEgwW/a6bP4muWJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b9abc46894e24bc90a83627440cc6685a732aa7c55b3f600d0b7fd842f90c4","last_reissued_at":"2026-05-18T00:20:49.033373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:49.033373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00429","source_version":2,"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-18T00:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"urOSn61A3f9J+UYABYCTGQjFniK0w4VObnDVNCSLiYX+6jM6ux5EeSlOJ1g+f5QClX+j1W4Ehraj1Zrpuk8iAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:25:51.359494Z"},"content_sha256":"55e894ebb5a406f3c48ce1d9df6e05b082d275c75165bd4e3affe359f19021f9","schema_version":"1.0","event_id":"sha256:55e894ebb5a406f3c48ce1d9df6e05b082d275c75165bd4e3affe359f19021f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KG42XRDISTREXSIKQNRHIQGMM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial-Time Algorithms for Sliding Tokens on Cactus Graphs and Block Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Duc A. Hoang, Ryuhei Uehara","submitted_at":"2017-05-01T07:18:55Z","abstract_excerpt":"Given two independent sets $I, J$ of a graph $G$, and imagine that a token (coin) is placed at each vertex of $I$. The Sliding Token problem asks if one could transform $I$ to $J$ via a sequence of elementary steps, where each step requires sliding a token from one vertex to one of its neighbors so that the resulting set of vertices where tokens are placed remains independent. This problem is $\\mathsf{PSPACE}$-complete even for planar graphs of maximum degree $3$ and bounded-treewidth. In this paper, we show that Sliding Token can be solved efficiently for cactus graphs and block graphs, and g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00429","kind":"arxiv","version":2},"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-18T00:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qD0cysC71IrSdA3G35LlqrZgOCqYDjCvJfQYtWt7J62rwABTqxelAGaJggRxcslWfX/pGFTbP0Z5bz5civPpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:25:51.359844Z"},"content_sha256":"7af667ef651a2eccb2ab27241f89ccb9c7fb613fcdb8975aa6f7eb1088a91372","schema_version":"1.0","event_id":"sha256:7af667ef651a2eccb2ab27241f89ccb9c7fb613fcdb8975aa6f7eb1088a91372"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KG42XRDISTREXSIKQNRHIQGMM2/bundle.json","state_url":"https://pith.science/pith/KG42XRDISTREXSIKQNRHIQGMM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KG42XRDISTREXSIKQNRHIQGMM2/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-06-03T08:25:51Z","links":{"resolver":"https://pith.science/pith/KG42XRDISTREXSIKQNRHIQGMM2","bundle":"https://pith.science/pith/KG42XRDISTREXSIKQNRHIQGMM2/bundle.json","state":"https://pith.science/pith/KG42XRDISTREXSIKQNRHIQGMM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KG42XRDISTREXSIKQNRHIQGMM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KG42XRDISTREXSIKQNRHIQGMM2","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":"c06f34f4a308a6ac2036a93d7e5d13d01a1853e744e27e81c32e57bb552e87b5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-01T07:18:55Z","title_canon_sha256":"390880e4da4f3b8b33a6f0613b2f53469d37f301f8abd4ff95685a0411365e4d"},"schema_version":"1.0","source":{"id":"1705.00429","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00429","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00429v2","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00429","created_at":"2026-05-18T00:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"KG42XRDISTRE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KG42XRDISTREXSIK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KG42XRDI","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:7af667ef651a2eccb2ab27241f89ccb9c7fb613fcdb8975aa6f7eb1088a91372","target":"graph","created_at":"2026-05-18T00:20:49Z","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":"Given two independent sets $I, J$ of a graph $G$, and imagine that a token (coin) is placed at each vertex of $I$. The Sliding Token problem asks if one could transform $I$ to $J$ via a sequence of elementary steps, where each step requires sliding a token from one vertex to one of its neighbors so that the resulting set of vertices where tokens are placed remains independent. This problem is $\\mathsf{PSPACE}$-complete even for planar graphs of maximum degree $3$ and bounded-treewidth. In this paper, we show that Sliding Token can be solved efficiently for cactus graphs and block graphs, and g","authors_text":"Duc A. Hoang, Ryuhei Uehara","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-01T07:18:55Z","title":"Polynomial-Time Algorithms for Sliding Tokens on Cactus Graphs and Block Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00429","kind":"arxiv","version":2},"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:55e894ebb5a406f3c48ce1d9df6e05b082d275c75165bd4e3affe359f19021f9","target":"record","created_at":"2026-05-18T00:20:49Z","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":"c06f34f4a308a6ac2036a93d7e5d13d01a1853e744e27e81c32e57bb552e87b5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-01T07:18:55Z","title_canon_sha256":"390880e4da4f3b8b33a6f0613b2f53469d37f301f8abd4ff95685a0411365e4d"},"schema_version":"1.0","source":{"id":"1705.00429","kind":"arxiv","version":2}},"canonical_sha256":"51b9abc46894e24bc90a83627440cc6685a732aa7c55b3f600d0b7fd842f90c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51b9abc46894e24bc90a83627440cc6685a732aa7c55b3f600d0b7fd842f90c4","first_computed_at":"2026-05-18T00:20:49.033373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:49.033373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CLKE3FQerPDQGjb7eUdyagZHtk7RshURpxzqLBRLEqcpRdzj6iaS3wnEJpAYU7o5RC6RpwEgwW/a6bP4muWJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:49.034067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00429","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55e894ebb5a406f3c48ce1d9df6e05b082d275c75165bd4e3affe359f19021f9","sha256:7af667ef651a2eccb2ab27241f89ccb9c7fb613fcdb8975aa6f7eb1088a91372"],"state_sha256":"4cc4d231485da3e3346da870e0805cfa06afc5f4a3a27bb31fc82f117a7d2369"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qtBv69dYylBaB2Dvu13d65GGio8E4EKCRAY3xPttgBJLEcVVDDdJyKLFuJhE18HhbmJWQqdXU8mKlbVdZVQ/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:25:51.362254Z","bundle_sha256":"25d6c64e91db1419f7739f096e03c6f1e1b0cbf7c2f8a465499e1432ff0d8549"}}