{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UVRTETUN7FCFLN5VTNJSXSGBX7","short_pith_number":"pith:UVRTETUN","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"},"canonical_sha256":"a563324e8df94455b7b59b532bc8c1bfd16f5b18d35ae6623b99d229f696e02a","source":{"kind":"arxiv","id":"1707.00572","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00572","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00572v1","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00572","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"UVRTETUN7FCF","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UVRTETUN7FCFLN5V","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UVRTETUN","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UVRTETUN7FCFLN5VTNJSXSGBX7","target":"record","payload":{"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"},"canonical_sha256":"a563324e8df94455b7b59b532bc8c1bfd16f5b18d35ae6623b99d229f696e02a","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"},"source_kind":"arxiv","source_id":"1707.00572","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-18T00:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vmcFcjk3uJjc7dbJpILS3HSNFFF6vneExj0ynPgCsCu6YVC8Os5WkTa+SmH2+GGHIGDBf9ZJRqXMbbgT58cyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:53:09.228290Z"},"content_sha256":"416216cfdfdc9c6cc59d174a91f4813aef4a4af6a67059eb18651d448a28932d","schema_version":"1.0","event_id":"sha256:416216cfdfdc9c6cc59d174a91f4813aef4a4af6a67059eb18651d448a28932d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UVRTETUN7FCFLN5VTNJSXSGBX7","target":"graph","payload":{"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"},"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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bH7iD7zwIJNDv9nh3o34ylnXZgwd5N3ufY+NdiWMt63mfSBUfzgUBDHPST4pd6ShcIea7SvyqLYoYaUUx9k/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:53:09.228649Z"},"content_sha256":"22d423d7588ba9981aa0f6391fb77697ceab047afbb166cca078c6f6be20d918","schema_version":"1.0","event_id":"sha256:22d423d7588ba9981aa0f6391fb77697ceab047afbb166cca078c6f6be20d918"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7/bundle.json","state_url":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVRTETUN7FCFLN5VTNJSXSGBX7/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-26T13:53:09Z","links":{"resolver":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7","bundle":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7/bundle.json","state":"https://pith.science/pith/UVRTETUN7FCFLN5VTNJSXSGBX7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVRTETUN7FCFLN5VTNJSXSGBX7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UVRTETUN7FCFLN5VTNJSXSGBX7","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":"aa83cab394c23f3dda187a2b51717a11ddff8c4a68d40dbd4b92881be285a865","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-03T14:35:26Z","title_canon_sha256":"c91ddbc3acdfc7ecfaa857f98636abc34983dcc169c3c560c69aafff17863c11"},"schema_version":"1.0","source":{"id":"1707.00572","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00572","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00572v1","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00572","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"UVRTETUN7FCF","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UVRTETUN7FCFLN5V","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UVRTETUN","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:22d423d7588ba9981aa0f6391fb77697ceab047afbb166cca078c6f6be20d918","target":"graph","created_at":"2026-05-18T00:41: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":"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","authors_text":"Jens M. Schmidt, On-Hei Solomon Lo","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-03T14:35:26Z","title":"Cut Tree Structures with Applications on Contraction-Based Sparsification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00572","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:416216cfdfdc9c6cc59d174a91f4813aef4a4af6a67059eb18651d448a28932d","target":"record","created_at":"2026-05-18T00:41: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":"aa83cab394c23f3dda187a2b51717a11ddff8c4a68d40dbd4b92881be285a865","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-03T14:35:26Z","title_canon_sha256":"c91ddbc3acdfc7ecfaa857f98636abc34983dcc169c3c560c69aafff17863c11"},"schema_version":"1.0","source":{"id":"1707.00572","kind":"arxiv","version":1}},"canonical_sha256":"a563324e8df94455b7b59b532bc8c1bfd16f5b18d35ae6623b99d229f696e02a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a563324e8df94455b7b59b532bc8c1bfd16f5b18d35ae6623b99d229f696e02a","first_computed_at":"2026-05-18T00:41:02.974504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:02.974504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ADjlI7IxDF06H3c7ggcVrVXlIPMzJOOYFkMKDKVjTtw653vYW6htQGYE/3I3e+UNKDkkOSxXO4S4jrUoKUYwBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:02.975261Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00572","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:416216cfdfdc9c6cc59d174a91f4813aef4a4af6a67059eb18651d448a28932d","sha256:22d423d7588ba9981aa0f6391fb77697ceab047afbb166cca078c6f6be20d918"],"state_sha256":"bb930ac8061533fe1ce3de1576a8e8ec22b213553b1fa20e9291e0e3242f00d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A2d3CPrdJceGtnTnqb9Kac9Bmtd3aYKqjKgIubvdI5exj9crpY3+KHlgxaELAtCAfF46l+XE4Fyf+6+u+SF5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:53:09.230547Z","bundle_sha256":"6f641d4d1cf6b4f4c3a13ec9e0c990a6cc0190d9a83d680c1f9ec83886796603"}}