{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PLZWV23QSEFSIEU6UGW764O72S","short_pith_number":"pith:PLZWV23Q","schema_version":"1.0","canonical_sha256":"7af36aeb70910b24129ea1adff71dfd48ba171ee0d04be9dd82499eb368a2934","source":{"kind":"arxiv","id":"1509.07680","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.07680","created_at":"2026-05-18T01:32:02.194787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07680v1","created_at":"2026-05-18T01:32:02.194787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07680","created_at":"2026-05-18T01:32:02.194787+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLZWV23QSEFS","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLZWV23QSEFSIEU6","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLZWV23Q","created_at":"2026-05-18T12:29:37.295048+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/PLZWV23QSEFSIEU6UGW764O72S","json":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S.json","graph_json":"https://pith.science/api/pith-number/PLZWV23QSEFSIEU6UGW764O72S/graph.json","events_json":"https://pith.science/api/pith-number/PLZWV23QSEFSIEU6UGW764O72S/events.json","paper":"https://pith.science/paper/PLZWV23Q"},"agent_actions":{"view_html":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S","download_json":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S.json","view_paper":"https://pith.science/paper/PLZWV23Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07680&json=true","fetch_graph":"https://pith.science/api/pith-number/PLZWV23QSEFSIEU6UGW764O72S/graph.json","fetch_events":"https://pith.science/api/pith-number/PLZWV23QSEFSIEU6UGW764O72S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S/action/storage_attestation","attest_author":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S/action/author_attestation","sign_citation":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S/action/citation_signature","submit_replication":"https://pith.science/pith/PLZWV23QSEFSIEU6UGW764O72S/action/replication_record"}},"created_at":"2026-05-18T01:32:02.194787+00:00","updated_at":"2026-05-18T01:32:02.194787+00:00"}