{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UVRTETUN7FCFLN5VTNJSXSGBX7","short_pith_number":"pith:UVRTETUN","schema_version":"1.0","canonical_sha256":"a563324e8df94455b7b59b532bc8c1bfd16f5b18d35ae6623b99d229f696e02a","source":{"kind":"arxiv","id":"1707.00572","version":1},"attestation_state":"computed","paper":{"title":"Cut Tree Structures with Applications on Contraction-Based Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jens M. Schmidt, On-Hei Solomon Lo","submitted_at":"2017-07-03T14:35:26Z","abstract_excerpt":"We introduce three new cut tree structures of graphs $G$ in which the vertex set of the tree is a partition of $V(G)$ and contractions of tree vertices satisfy sparsification requirements that preserve various types of cuts. Recently, Kawarabayashi and Thorup \\cite{Kawarabayashi2015a} presented the first deterministic near-linear edge-connectivity recognition algorithm. A crucial step in this algorithm uses the existence of vertex subsets of a simple graph $G$ whose contractions leave a graph with $\\tilde{O}(n/\\delta)$ vertices and $\\tilde{O}(n)$ edges ($n := |V(G)|$) such that all non-trivial"},"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":"1707.00572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-03T14:35:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c91ddbc3acdfc7ecfaa857f98636abc34983dcc169c3c560c69aafff17863c11","abstract_canon_sha256":"aa83cab394c23f3dda187a2b51717a11ddff8c4a68d40dbd4b92881be285a865"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:02.975261Z","signature_b64":"ADjlI7IxDF06H3c7ggcVrVXlIPMzJOOYFkMKDKVjTtw653vYW6htQGYE/3I3e+UNKDkkOSxXO4S4jrUoKUYwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a563324e8df94455b7b59b532bc8c1bfd16f5b18d35ae6623b99d229f696e02a","last_reissued_at":"2026-05-18T00:41:02.974504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:02.974504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cut Tree Structures with Applications on Contraction-Based Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jens M. Schmidt, On-Hei Solomon Lo","submitted_at":"2017-07-03T14:35:26Z","abstract_excerpt":"We introduce three new cut tree structures of graphs $G$ in which the vertex set of the tree is a partition of $V(G)$ and contractions of tree vertices satisfy sparsification requirements that preserve various types of cuts. Recently, Kawarabayashi and Thorup \\cite{Kawarabayashi2015a} presented the first deterministic near-linear edge-connectivity recognition algorithm. A crucial step in this algorithm uses the existence of vertex subsets of a simple graph $G$ whose contractions leave a graph with $\\tilde{O}(n/\\delta)$ vertices and $\\tilde{O}(n)$ edges ($n := |V(G)|$) such that all non-trivial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00572","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":"1707.00572","created_at":"2026-05-18T00:41:02.974636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00572v1","created_at":"2026-05-18T00:41:02.974636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00572","created_at":"2026-05-18T00:41:02.974636+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVRTETUN7FCF","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVRTETUN7FCFLN5V","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVRTETUN","created_at":"2026-05-18T12:31:49.984773+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/UVRTETUN7FCFLN5VTNJSXSGBX7","json":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7.json","graph_json":"https://pith.science/api/pith-number/UVRTETUN7FCFLN5VTNJSXSGBX7/graph.json","events_json":"https://pith.science/api/pith-number/UVRTETUN7FCFLN5VTNJSXSGBX7/events.json","paper":"https://pith.science/paper/UVRTETUN"},"agent_actions":{"view_html":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7","download_json":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7.json","view_paper":"https://pith.science/paper/UVRTETUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00572&json=true","fetch_graph":"https://pith.science/api/pith-number/UVRTETUN7FCFLN5VTNJSXSGBX7/graph.json","fetch_events":"https://pith.science/api/pith-number/UVRTETUN7FCFLN5VTNJSXSGBX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7/action/storage_attestation","attest_author":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7/action/author_attestation","sign_citation":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7/action/citation_signature","submit_replication":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7/action/replication_record"}},"created_at":"2026-05-18T00:41:02.974636+00:00","updated_at":"2026-05-18T00:41:02.974636+00:00"}