{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:W7VSNPRFA7VQNBU4DWZ7HTRSI3","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":"879f865c241c4d87cec4845d6db9dc4b941b685c59d50d6e3004230263f96001","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-15T15:42:54Z","title_canon_sha256":"60390b5a7a7c7c8031e873079f4aede862a52f993cc10a75d1a6b2f50fea71c1"},"schema_version":"1.0","source":{"id":"2407.10830","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.10830","created_at":"2026-07-05T08:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"2407.10830v1","created_at":"2026-07-05T08:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.10830","created_at":"2026-07-05T08:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"W7VSNPRFA7VQ","created_at":"2026-07-05T08:44:04Z"},{"alias_kind":"pith_short_16","alias_value":"W7VSNPRFA7VQNBU4","created_at":"2026-07-05T08:44:04Z"},{"alias_kind":"pith_short_8","alias_value":"W7VSNPRF","created_at":"2026-07-05T08:44:04Z"}],"graph_snapshots":[{"event_id":"sha256:fd8bce8d24f093eeb2d3f5e0f4393f98cc4fc1f4372fea07934ba5341548d5eb","target":"graph","created_at":"2026-07-05T08:44:04Z","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/2407.10830/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give the first almost-linear total time algorithm for deciding if a flow of cost at most $F$ still exists in a directed graph, with edge costs and capacities, undergoing decremental updates, i.e., edge deletions, capacity decreases, and cost increases. This implies almost-linear time algorithms for approximating the minimum-cost flow value and $s$-$t$ distance on such decremental graphs. Our framework additionally allows us to maintain decremental strongly connected components in almost-linear time deterministically. These algorithms also improve over the current best known runtimes for sta","authors_text":"Jan van den Brand, Li Chen, Maximilian Probst Gutenberg, Rasmus Kyng, Simon Meierhans, Sushant Sachdeva, Yang P. Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-15T15:42:54Z","title":"Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.10830","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:9b12809bb36ff4065940ac9a48aa49fda92666dd261dfc5a64ca1b5c697567a5","target":"record","created_at":"2026-07-05T08:44:04Z","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":"879f865c241c4d87cec4845d6db9dc4b941b685c59d50d6e3004230263f96001","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-15T15:42:54Z","title_canon_sha256":"60390b5a7a7c7c8031e873079f4aede862a52f993cc10a75d1a6b2f50fea71c1"},"schema_version":"1.0","source":{"id":"2407.10830","kind":"arxiv","version":1}},"canonical_sha256":"b7eb26be2507eb06869c1db3f3ce3246f4acb9881bb3a0725e5143a0d68ce37c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7eb26be2507eb06869c1db3f3ce3246f4acb9881bb3a0725e5143a0d68ce37c","first_computed_at":"2026-07-05T08:44:04.788537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:44:04.788537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PJAfkpaaExp+2842k1+5oA6Sm/lmKCQYQB611btjTKCx9v9GzTM0aKAJzh9leukWS/0hcRFj1iWeD5V/2FriAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:44:04.788953Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.10830","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b12809bb36ff4065940ac9a48aa49fda92666dd261dfc5a64ca1b5c697567a5","sha256:fd8bce8d24f093eeb2d3f5e0f4393f98cc4fc1f4372fea07934ba5341548d5eb"],"state_sha256":"11921d4f088947ab3e5de4bc75825751a06fbb87b941850cd24a264fd2a7a043"}