{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:URHLAKCX7DXQ6H4XFXMG6COADB","short_pith_number":"pith:URHLAKCX","canonical_record":{"source":{"id":"2404.13446","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-20T19:08:00Z","cross_cats_sorted":[],"title_canon_sha256":"360d265012203627178b48fcb891d54323231087fecc8fee18ca99fb76dfe66f","abstract_canon_sha256":"5914529b316a45a6335845ded3494c04796b244d4b94e69bb15be2e1ad4ea2c2"},"schema_version":"1.0"},"canonical_sha256":"a44eb02857f8ef0f1f972dd86f09c0187e987d66e6c55643ea95d55d6bef6da4","source":{"kind":"arxiv","id":"2404.13446","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.13446","created_at":"2026-07-05T08:19:24Z"},{"alias_kind":"arxiv_version","alias_value":"2404.13446v2","created_at":"2026-07-05T08:19:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.13446","created_at":"2026-07-05T08:19:24Z"},{"alias_kind":"pith_short_12","alias_value":"URHLAKCX7DXQ","created_at":"2026-07-05T08:19:24Z"},{"alias_kind":"pith_short_16","alias_value":"URHLAKCX7DXQ6H4X","created_at":"2026-07-05T08:19:24Z"},{"alias_kind":"pith_short_8","alias_value":"URHLAKCX","created_at":"2026-07-05T08:19:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:URHLAKCX7DXQ6H4XFXMG6COADB","target":"record","payload":{"canonical_record":{"source":{"id":"2404.13446","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-20T19:08:00Z","cross_cats_sorted":[],"title_canon_sha256":"360d265012203627178b48fcb891d54323231087fecc8fee18ca99fb76dfe66f","abstract_canon_sha256":"5914529b316a45a6335845ded3494c04796b244d4b94e69bb15be2e1ad4ea2c2"},"schema_version":"1.0"},"canonical_sha256":"a44eb02857f8ef0f1f972dd86f09c0187e987d66e6c55643ea95d55d6bef6da4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:19:24.270648Z","signature_b64":"DRvWU3RLOPiphR9nLeWe63xiDIUQm6b7qgDMmKpx2z+S6zAxpSGmFMKC4f00ouMXRh/Iu+PQia8TyqnWrJHTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a44eb02857f8ef0f1f972dd86f09c0187e987d66e6c55643ea95d55d6bef6da4","last_reissued_at":"2026-07-05T08:19:24.270160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:19:24.270160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.13446","source_version":2,"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-05T08:19:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j63GtW8m/KJ8xNq7KJSLOky7ZZE6XGzMtsjuVX6dTW4/PU1On+tkeiiXsQXqofz5OgsaNRrhQRLT4MHCVXvGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:17:00.777223Z"},"content_sha256":"6233c418bf9e79e29b423247b1882058df6a7ae2963b1f2b43e093e0d53ebc38","schema_version":"1.0","event_id":"sha256:6233c418bf9e79e29b423247b1882058df6a7ae2963b1f2b43e093e0d53ebc38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:URHLAKCX7DXQ6H4XFXMG6COADB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Structures and Algorithms for Length-Constrained Expander Decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, D Ellis Hershkowitz, Zihan Tan","submitted_at":"2024-04-20T19:08:00Z","abstract_excerpt":"Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems with lengths, distances and costs. Roughly, an $(h,s)$-length $\\phi$-expander decomposition is a small collection of length increases to a graph so that nodes within distance $h$ can route flow over paths of length $hs$ with congestion at most $1/\\phi$.\n  In this work, we give a close-to-linear time algorithm for computing length-constrained expander decompositions in graphs with g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.13446","kind":"arxiv","version":2},"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/2404.13446/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-05T08:19:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6hPTWqEpvhAik2qM2DNfIzVoi0GqX2mj7uC03jc4+E8sG5u112GUHVTpVR0lNqQ+VSa2A+3dC/KRk6G/HPz3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:17:00.777753Z"},"content_sha256":"028f1c6bc69870ccb5a5392e6bad39ba7eb8cc579f03a66126c730a8c8ed518a","schema_version":"1.0","event_id":"sha256:028f1c6bc69870ccb5a5392e6bad39ba7eb8cc579f03a66126c730a8c8ed518a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URHLAKCX7DXQ6H4XFXMG6COADB/bundle.json","state_url":"https://pith.science/pith/URHLAKCX7DXQ6H4XFXMG6COADB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URHLAKCX7DXQ6H4XFXMG6COADB/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-08-16T21:17:00Z","links":{"resolver":"https://pith.science/pith/URHLAKCX7DXQ6H4XFXMG6COADB","bundle":"https://pith.science/pith/URHLAKCX7DXQ6H4XFXMG6COADB/bundle.json","state":"https://pith.science/pith/URHLAKCX7DXQ6H4XFXMG6COADB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URHLAKCX7DXQ6H4XFXMG6COADB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:URHLAKCX7DXQ6H4XFXMG6COADB","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":"5914529b316a45a6335845ded3494c04796b244d4b94e69bb15be2e1ad4ea2c2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-20T19:08:00Z","title_canon_sha256":"360d265012203627178b48fcb891d54323231087fecc8fee18ca99fb76dfe66f"},"schema_version":"1.0","source":{"id":"2404.13446","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.13446","created_at":"2026-07-05T08:19:24Z"},{"alias_kind":"arxiv_version","alias_value":"2404.13446v2","created_at":"2026-07-05T08:19:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.13446","created_at":"2026-07-05T08:19:24Z"},{"alias_kind":"pith_short_12","alias_value":"URHLAKCX7DXQ","created_at":"2026-07-05T08:19:24Z"},{"alias_kind":"pith_short_16","alias_value":"URHLAKCX7DXQ6H4X","created_at":"2026-07-05T08:19:24Z"},{"alias_kind":"pith_short_8","alias_value":"URHLAKCX","created_at":"2026-07-05T08:19:24Z"}],"graph_snapshots":[{"event_id":"sha256:028f1c6bc69870ccb5a5392e6bad39ba7eb8cc579f03a66126c730a8c8ed518a","target":"graph","created_at":"2026-07-05T08:19:24Z","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/2404.13446/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems with lengths, distances and costs. Roughly, an $(h,s)$-length $\\phi$-expander decomposition is a small collection of length increases to a graph so that nodes within distance $h$ can route flow over paths of length $hs$ with congestion at most $1/\\phi$.\n  In this work, we give a close-to-linear time algorithm for computing length-constrained expander decompositions in graphs with g","authors_text":"Bernhard Haeupler, D Ellis Hershkowitz, Zihan Tan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-20T19:08:00Z","title":"New Structures and Algorithms for Length-Constrained Expander Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.13446","kind":"arxiv","version":2},"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:6233c418bf9e79e29b423247b1882058df6a7ae2963b1f2b43e093e0d53ebc38","target":"record","created_at":"2026-07-05T08:19:24Z","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":"5914529b316a45a6335845ded3494c04796b244d4b94e69bb15be2e1ad4ea2c2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-20T19:08:00Z","title_canon_sha256":"360d265012203627178b48fcb891d54323231087fecc8fee18ca99fb76dfe66f"},"schema_version":"1.0","source":{"id":"2404.13446","kind":"arxiv","version":2}},"canonical_sha256":"a44eb02857f8ef0f1f972dd86f09c0187e987d66e6c55643ea95d55d6bef6da4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a44eb02857f8ef0f1f972dd86f09c0187e987d66e6c55643ea95d55d6bef6da4","first_computed_at":"2026-07-05T08:19:24.270160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:19:24.270160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DRvWU3RLOPiphR9nLeWe63xiDIUQm6b7qgDMmKpx2z+S6zAxpSGmFMKC4f00ouMXRh/Iu+PQia8TyqnWrJHTBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:19:24.270648Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.13446","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6233c418bf9e79e29b423247b1882058df6a7ae2963b1f2b43e093e0d53ebc38","sha256:028f1c6bc69870ccb5a5392e6bad39ba7eb8cc579f03a66126c730a8c8ed518a"],"state_sha256":"89c0b88502431181200b75315132f43f861802c77d056f30543b8e21c40c318c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzJ9TQC0rMybTSrOH12PvydEsQk0yD6zhekhWtwIc0XzJih4+MGuLmPZu99Fm2Lrp1tx/npil/Y0+vKw2323CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T21:17:00.781347Z","bundle_sha256":"3221c47d15896d0de1a48a21804a155509fc51d5a07cdf37d63b2bbd5c26fa56"}}