{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JMX3ETJZW6DIYILNUM5PG7IZAO","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":"2fc66e150512dd0e3a566742deac2a5e1655c7e5cf70cd97d106ccd81f03fe31","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T13:40:42Z","title_canon_sha256":"3adb66fd596ab97eb32082b13c4c195784906d4b8507d6e6d559a45e25482e23"},"schema_version":"1.0","source":{"id":"2607.00938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00938","created_at":"2026-07-02T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00938v1","created_at":"2026-07-02T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00938","created_at":"2026-07-02T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"JMX3ETJZW6DI","created_at":"2026-07-02T01:18:24Z"},{"alias_kind":"pith_short_16","alias_value":"JMX3ETJZW6DIYILN","created_at":"2026-07-02T01:18:24Z"},{"alias_kind":"pith_short_8","alias_value":"JMX3ETJZ","created_at":"2026-07-02T01:18:24Z"}],"graph_snapshots":[{"event_id":"sha256:9710cfc9d7c6ffa1a22c816a1b6105fa8de8542d68ecec09899746db96aae6e0","target":"graph","created_at":"2026-07-02T01:18: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/2607.00938/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of approximating the length of a shortest cycle in a given graph, known as the girth of the graph. The state-of-the-art approximation algorithms for unweighted graphs by Kadria et al. [SODA'22] and Roditty and Trabelsi [arXiv'25] achieve the following trade-off: for every integer $k\\geq 2$, there is an $\\tilde{O}(n^{1+2/k})$ time algorithm that achieves a $(2k/3)$-approximation for the girth in unweighted $n$-node graphs. The first result of this paper is to achieve the same trade-off for $m$-edge, $n$-node graphs with non-negative real edge weights: a $2k/3$-approximation","authors_text":"Avi Kadria, Liam Roditty, Virginia Vassilevska Williams","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T13:40:42Z","title":"Tighter bounds for weighted and unweighted shortest cycle approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00938","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:1b70d065b2408293a93c070f591bbb31ff71f1d841e7e7a2669213c6de99215a","target":"record","created_at":"2026-07-02T01:18: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":"2fc66e150512dd0e3a566742deac2a5e1655c7e5cf70cd97d106ccd81f03fe31","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T13:40:42Z","title_canon_sha256":"3adb66fd596ab97eb32082b13c4c195784906d4b8507d6e6d559a45e25482e23"},"schema_version":"1.0","source":{"id":"2607.00938","kind":"arxiv","version":1}},"canonical_sha256":"4b2fb24d39b7868c216da33af37d1903938bb1e24f1d78468d2c0f6f7f722183","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b2fb24d39b7868c216da33af37d1903938bb1e24f1d78468d2c0f6f7f722183","first_computed_at":"2026-07-02T01:18:24.024173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:18:24.024173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mh3iJSrL9ciq4GDoVam5mVLE1+nwv4AfnOm6rnGdMP0jA8RwtSO0zy5T3fsyFhIhHQq253EvJ5qtu2MxtvJ4Dg==","signature_status":"signed_v1","signed_at":"2026-07-02T01:18:24.024536Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b70d065b2408293a93c070f591bbb31ff71f1d841e7e7a2669213c6de99215a","sha256:9710cfc9d7c6ffa1a22c816a1b6105fa8de8542d68ecec09899746db96aae6e0"],"state_sha256":"c852a522628509155825d0b4da2805407001922f0e0bb88a039476b4619fe5c9"}