{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PLZWV23QSEFSIEU6UGW764O72S","short_pith_number":"pith:PLZWV23Q","canonical_record":{"source":{"id":"1509.07680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-25T11:13:38Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"3a68269e9c8faeac9c36d283fffb7bc3e22c2fa721de27f6938fac824a06bf9f","abstract_canon_sha256":"8cd03ce3100b6f4154040093711cb3db306394fbb9ab56ac94613e76430f48fc"},"schema_version":"1.0"},"canonical_sha256":"7af36aeb70910b24129ea1adff71dfd48ba171ee0d04be9dd82499eb368a2934","source":{"kind":"arxiv","id":"1509.07680","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07680","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07680v1","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07680","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"pith_short_12","alias_value":"PLZWV23QSEFS","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PLZWV23QSEFSIEU6","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PLZWV23Q","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PLZWV23QSEFSIEU6UGW764O72S","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-25T11:13:38Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"3a68269e9c8faeac9c36d283fffb7bc3e22c2fa721de27f6938fac824a06bf9f","abstract_canon_sha256":"8cd03ce3100b6f4154040093711cb3db306394fbb9ab56ac94613e76430f48fc"},"schema_version":"1.0"},"canonical_sha256":"7af36aeb70910b24129ea1adff71dfd48ba171ee0d04be9dd82499eb368a2934","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:02.195159Z","signature_b64":"CO+FYa6SXkHGuOv+J81wv+lHkPx3DN2Kq2mhxszj/2oYkGEApnaQrCehFSgNA2lDT2nI6VQ2bb6SaVz6wRx9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7af36aeb70910b24129ea1adff71dfd48ba171ee0d04be9dd82499eb368a2934","last_reissued_at":"2026-05-18T01:32:02.194719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:02.194719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07680","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-18T01:32:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"em56NLEGEQ0TpCpr7dc8uJIb3TxC8eLBaOpu5AUmB93187UmhClH9Ed15oIynmNVqHbmbEL72iwbDoNbPdWgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:57:48.625603Z"},"content_sha256":"5a7e85d8fa392ff93ec50c024d5f3424879038b3be402b247b442cbde7741395","schema_version":"1.0","event_id":"sha256:5a7e85d8fa392ff93ec50c024d5f3424879038b3be402b247b442cbde7741395"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PLZWV23QSEFSIEU6UGW764O72S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Bruce Reed, Ken-ichi Kawarabayashi, Zhentao Li","submitted_at":"2015-09-25T11:13:38Z","abstract_excerpt":"In this paper we show how to combine two algorithmic techniques to obtain linear time algorithms for various optimization problems on graphs, and present a subroutine which will be useful in doing so.\n  The first technique is iterative shrinking. In the first phase of an iterative shrinking algorithm, we construct a sequence of graphs of decreasing size $G_1,\\ldots,G_\\ell$ where $G_1$ is the initial input, $G_\\ell$ is a graph on which the problem is easy, and $G_i$ is obtained from $G_{i+1}$ via some shrinking algorithm. In the second phase we work through the sequence in reverse, repeatedly c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07680","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-18T01:32:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EF+4zKVee2KVuvcTUQAyH4qppLE6q15bDBrq0Wa0qsMGCNJ8eJOoFRqo3KK9MJjzXLfvPtdYun+hcadRxET3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:57:48.625951Z"},"content_sha256":"c0c24b167a5f06cfaa45d5fe77d4b314fc6f502371c32dd680df45c8a390ee36","schema_version":"1.0","event_id":"sha256:c0c24b167a5f06cfaa45d5fe77d4b314fc6f502371c32dd680df45c8a390ee36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S/bundle.json","state_url":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLZWV23QSEFSIEU6UGW764O72S/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-02T21:57:48Z","links":{"resolver":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S","bundle":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S/bundle.json","state":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLZWV23QSEFSIEU6UGW764O72S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PLZWV23QSEFSIEU6UGW764O72S","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":"8cd03ce3100b6f4154040093711cb3db306394fbb9ab56ac94613e76430f48fc","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-25T11:13:38Z","title_canon_sha256":"3a68269e9c8faeac9c36d283fffb7bc3e22c2fa721de27f6938fac824a06bf9f"},"schema_version":"1.0","source":{"id":"1509.07680","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07680","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07680v1","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07680","created_at":"2026-05-18T01:32:02Z"},{"alias_kind":"pith_short_12","alias_value":"PLZWV23QSEFS","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PLZWV23QSEFSIEU6","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PLZWV23Q","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:c0c24b167a5f06cfaa45d5fe77d4b314fc6f502371c32dd680df45c8a390ee36","target":"graph","created_at":"2026-05-18T01:32:02Z","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":"In this paper we show how to combine two algorithmic techniques to obtain linear time algorithms for various optimization problems on graphs, and present a subroutine which will be useful in doing so.\n  The first technique is iterative shrinking. In the first phase of an iterative shrinking algorithm, we construct a sequence of graphs of decreasing size $G_1,\\ldots,G_\\ell$ where $G_1$ is the initial input, $G_\\ell$ is a graph on which the problem is easy, and $G_i$ is obtained from $G_{i+1}$ via some shrinking algorithm. In the second phase we work through the sequence in reverse, repeatedly c","authors_text":"Bruce Reed, Ken-ichi Kawarabayashi, Zhentao Li","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-25T11:13:38Z","title":"Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07680","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:5a7e85d8fa392ff93ec50c024d5f3424879038b3be402b247b442cbde7741395","target":"record","created_at":"2026-05-18T01:32:02Z","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":"8cd03ce3100b6f4154040093711cb3db306394fbb9ab56ac94613e76430f48fc","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-25T11:13:38Z","title_canon_sha256":"3a68269e9c8faeac9c36d283fffb7bc3e22c2fa721de27f6938fac824a06bf9f"},"schema_version":"1.0","source":{"id":"1509.07680","kind":"arxiv","version":1}},"canonical_sha256":"7af36aeb70910b24129ea1adff71dfd48ba171ee0d04be9dd82499eb368a2934","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7af36aeb70910b24129ea1adff71dfd48ba171ee0d04be9dd82499eb368a2934","first_computed_at":"2026-05-18T01:32:02.194719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:02.194719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CO+FYa6SXkHGuOv+J81wv+lHkPx3DN2Kq2mhxszj/2oYkGEApnaQrCehFSgNA2lDT2nI6VQ2bb6SaVz6wRx9Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:02.195159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07680","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a7e85d8fa392ff93ec50c024d5f3424879038b3be402b247b442cbde7741395","sha256:c0c24b167a5f06cfaa45d5fe77d4b314fc6f502371c32dd680df45c8a390ee36"],"state_sha256":"d380d899d7b6ffa31938898a07b63b2a2f88b4c70fd43be7c4a88fdaf6117794"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqT/0LEFh/mMuFKXPyaouBnufQWumnLqNcFmdcgSjo7Z9ZPfI3yHqRS5ZsScQDuWcHbUNOTWIALnOyoV0CCRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:57:48.627946Z","bundle_sha256":"2e24272f30d81121acfd8c9e932d44881077cf239b6e1c765906a9a5e781dd55"}}