{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:MJIBOEXOW5WPUQYS56ASTKANIX","short_pith_number":"pith:MJIBOEXO","canonical_record":{"source":{"id":"2112.01042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-02T08:08:33Z","cross_cats_sorted":[],"title_canon_sha256":"e9dedd530958c239ed5439b47ac7fb10f0b6e6ecb8679e975ef887cb35f5afb0","abstract_canon_sha256":"651b373bfc545e03039dbbf3b3bb86cbab5bfb88824b507fba3d19642f9b653a"},"schema_version":"1.0"},"canonical_sha256":"62501712eeb76cfa4312ef8129a80d45c30e16e474aa9de7199717ca4647d172","source":{"kind":"arxiv","id":"2112.01042","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.01042","created_at":"2026-07-05T03:37:02Z"},{"alias_kind":"arxiv_version","alias_value":"2112.01042v1","created_at":"2026-07-05T03:37:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01042","created_at":"2026-07-05T03:37:02Z"},{"alias_kind":"pith_short_12","alias_value":"MJIBOEXOW5WP","created_at":"2026-07-05T03:37:02Z"},{"alias_kind":"pith_short_16","alias_value":"MJIBOEXOW5WPUQYS","created_at":"2026-07-05T03:37:02Z"},{"alias_kind":"pith_short_8","alias_value":"MJIBOEXO","created_at":"2026-07-05T03:37:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:MJIBOEXOW5WPUQYS56ASTKANIX","target":"record","payload":{"canonical_record":{"source":{"id":"2112.01042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-02T08:08:33Z","cross_cats_sorted":[],"title_canon_sha256":"e9dedd530958c239ed5439b47ac7fb10f0b6e6ecb8679e975ef887cb35f5afb0","abstract_canon_sha256":"651b373bfc545e03039dbbf3b3bb86cbab5bfb88824b507fba3d19642f9b653a"},"schema_version":"1.0"},"canonical_sha256":"62501712eeb76cfa4312ef8129a80d45c30e16e474aa9de7199717ca4647d172","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:02.991941Z","signature_b64":"ymMZEQa/IwfRB85+fxrHjq7T5ZrSzjjwV4Umh5Wg6gniCH7HN3nbhoO1GXVG4xshPqc9isO1sPQuDPXU5htFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62501712eeb76cfa4312ef8129a80d45c30e16e474aa9de7199717ca4647d172","last_reissued_at":"2026-07-05T03:37:02.991486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:02.991486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.01042","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-07-05T03:37:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPJFHxXq9Ew9/brAMl4slZjxFJssM4/KW7InDGyCcI8QKbxtEkNz0QOzRQheNPhB5SQfHKgUKLHpZhDNt/rqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T15:23:52.649682Z"},"content_sha256":"3cd3605afff5c18564c2081b55b292b220addb55b2820875e14807be713df2b9","schema_version":"1.0","event_id":"sha256:3cd3605afff5c18564c2081b55b292b220addb55b2820875e14807be713df2b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:MJIBOEXOW5WPUQYS56ASTKANIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gomory-Hu Trees in Quadratic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tianyi Zhang","submitted_at":"2021-12-02T08:08:33Z","abstract_excerpt":"Gomory-Hu tree [Gomory and Hu, 1961] is a succinct representation of pairwise minimum cuts in an undirected graph. When the input graph has general edge weights, classic algorithms need at least cubic running time to compute a Gomory-Hu tree. Very recently, the authors of [AKL+, arXiv v1, 2021] have improved the running time to $\\tilde{O}(n^{2.875})$ which breaks the cubic barrier for the first time. In this paper, we refine their approach and improve the running time to $\\tilde{O}(n^2)$. This quadratic upper bound is also obtained independently in an updated version by the same group of autho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01042","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.01042/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:37:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8R2xg3otSJrbaX/CqRhGUySZUJHyCyk5RSOlDy1SPVmYuG4fu9s0s1n0gMCr3C6HUDetryIHjytu+jT3fNsDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T15:23:52.650052Z"},"content_sha256":"ad72d49e36dc50e3dd744a110ee09de077424f802c3445eebbd6d7003f846946","schema_version":"1.0","event_id":"sha256:ad72d49e36dc50e3dd744a110ee09de077424f802c3445eebbd6d7003f846946"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX/bundle.json","state_url":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJIBOEXOW5WPUQYS56ASTKANIX/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-07-27T15:23:52Z","links":{"resolver":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX","bundle":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX/bundle.json","state":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJIBOEXOW5WPUQYS56ASTKANIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MJIBOEXOW5WPUQYS56ASTKANIX","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":"651b373bfc545e03039dbbf3b3bb86cbab5bfb88824b507fba3d19642f9b653a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-02T08:08:33Z","title_canon_sha256":"e9dedd530958c239ed5439b47ac7fb10f0b6e6ecb8679e975ef887cb35f5afb0"},"schema_version":"1.0","source":{"id":"2112.01042","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.01042","created_at":"2026-07-05T03:37:02Z"},{"alias_kind":"arxiv_version","alias_value":"2112.01042v1","created_at":"2026-07-05T03:37:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01042","created_at":"2026-07-05T03:37:02Z"},{"alias_kind":"pith_short_12","alias_value":"MJIBOEXOW5WP","created_at":"2026-07-05T03:37:02Z"},{"alias_kind":"pith_short_16","alias_value":"MJIBOEXOW5WPUQYS","created_at":"2026-07-05T03:37:02Z"},{"alias_kind":"pith_short_8","alias_value":"MJIBOEXO","created_at":"2026-07-05T03:37:02Z"}],"graph_snapshots":[{"event_id":"sha256:ad72d49e36dc50e3dd744a110ee09de077424f802c3445eebbd6d7003f846946","target":"graph","created_at":"2026-07-05T03:37: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.01042/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Gomory-Hu tree [Gomory and Hu, 1961] is a succinct representation of pairwise minimum cuts in an undirected graph. When the input graph has general edge weights, classic algorithms need at least cubic running time to compute a Gomory-Hu tree. Very recently, the authors of [AKL+, arXiv v1, 2021] have improved the running time to $\\tilde{O}(n^{2.875})$ which breaks the cubic barrier for the first time. In this paper, we refine their approach and improve the running time to $\\tilde{O}(n^2)$. This quadratic upper bound is also obtained independently in an updated version by the same group of autho","authors_text":"Tianyi Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-02T08:08:33Z","title":"Gomory-Hu Trees in Quadratic Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01042","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:3cd3605afff5c18564c2081b55b292b220addb55b2820875e14807be713df2b9","target":"record","created_at":"2026-07-05T03:37: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":"651b373bfc545e03039dbbf3b3bb86cbab5bfb88824b507fba3d19642f9b653a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-02T08:08:33Z","title_canon_sha256":"e9dedd530958c239ed5439b47ac7fb10f0b6e6ecb8679e975ef887cb35f5afb0"},"schema_version":"1.0","source":{"id":"2112.01042","kind":"arxiv","version":1}},"canonical_sha256":"62501712eeb76cfa4312ef8129a80d45c30e16e474aa9de7199717ca4647d172","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62501712eeb76cfa4312ef8129a80d45c30e16e474aa9de7199717ca4647d172","first_computed_at":"2026-07-05T03:37:02.991486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:37:02.991486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ymMZEQa/IwfRB85+fxrHjq7T5ZrSzjjwV4Umh5Wg6gniCH7HN3nbhoO1GXVG4xshPqc9isO1sPQuDPXU5htFBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:37:02.991941Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.01042","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cd3605afff5c18564c2081b55b292b220addb55b2820875e14807be713df2b9","sha256:ad72d49e36dc50e3dd744a110ee09de077424f802c3445eebbd6d7003f846946"],"state_sha256":"65081c4354de659d14bb0f5f499db72284176a85dd1abd8b32b8a50431cff9d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80WYlk+qTm3mTpyBPl8rxP8GLJpHDMEmch20rjGcE4QhzXYpLFVlgrlTAO5Hb4hmhnmdBBtbYClIIBIyfNjUAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-27T15:23:52.652815Z","bundle_sha256":"e336b2edada3bd620571eb69ee1148d7cb6d64aa9370d541e3bd5b4f65aa54f5"}}