{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JMX3ETJZW6DIYILNUM5PG7IZAO","short_pith_number":"pith:JMX3ETJZ","canonical_record":{"source":{"id":"2607.00938","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T13:40:42Z","cross_cats_sorted":[],"title_canon_sha256":"3adb66fd596ab97eb32082b13c4c195784906d4b8507d6e6d559a45e25482e23","abstract_canon_sha256":"2fc66e150512dd0e3a566742deac2a5e1655c7e5cf70cd97d106ccd81f03fe31"},"schema_version":"1.0"},"canonical_sha256":"4b2fb24d39b7868c216da33af37d1903938bb1e24f1d78468d2c0f6f7f722183","source":{"kind":"arxiv","id":"2607.00938","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JMX3ETJZW6DIYILNUM5PG7IZAO","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00938","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T13:40:42Z","cross_cats_sorted":[],"title_canon_sha256":"3adb66fd596ab97eb32082b13c4c195784906d4b8507d6e6d559a45e25482e23","abstract_canon_sha256":"2fc66e150512dd0e3a566742deac2a5e1655c7e5cf70cd97d106ccd81f03fe31"},"schema_version":"1.0"},"canonical_sha256":"4b2fb24d39b7868c216da33af37d1903938bb1e24f1d78468d2c0f6f7f722183","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:18:24.024536Z","signature_b64":"Mh3iJSrL9ciq4GDoVam5mVLE1+nwv4AfnOm6rnGdMP0jA8RwtSO0zy5T3fsyFhIhHQq253EvJ5qtu2MxtvJ4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b2fb24d39b7868c216da33af37d1903938bb1e24f1d78468d2c0f6f7f722183","last_reissued_at":"2026-07-02T01:18:24.024173Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:18:24.024173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00938","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-02T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6t7GmUSuwCCbtSyVaW9sPuaAn10OKUWeP+yvWWhmqHIBKfngrusq/zPdIf4UxTyFZN3U+TfWlXKdIlzr2/CBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T17:21:03.121212Z"},"content_sha256":"1b70d065b2408293a93c070f591bbb31ff71f1d841e7e7a2669213c6de99215a","schema_version":"1.0","event_id":"sha256:1b70d065b2408293a93c070f591bbb31ff71f1d841e7e7a2669213c6de99215a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JMX3ETJZW6DIYILNUM5PG7IZAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tighter bounds for weighted and unweighted shortest cycle approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Avi Kadria, Liam Roditty, Virginia Vassilevska Williams","submitted_at":"2026-07-01T13:40:42Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00938","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/2607.00938/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-02T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LFH7FrMDc4toA+Z4xmfm9g9HpfgFsNLlmVAeM+iQRiFedsKdl+/n+bscSoSjHxawvQnhTamXJ7CkPAtyJ2kUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T17:21:03.121611Z"},"content_sha256":"9710cfc9d7c6ffa1a22c816a1b6105fa8de8542d68ecec09899746db96aae6e0","schema_version":"1.0","event_id":"sha256:9710cfc9d7c6ffa1a22c816a1b6105fa8de8542d68ecec09899746db96aae6e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMX3ETJZW6DIYILNUM5PG7IZAO/bundle.json","state_url":"https://pith.science/pith/JMX3ETJZW6DIYILNUM5PG7IZAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMX3ETJZW6DIYILNUM5PG7IZAO/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-02T17:21:03Z","links":{"resolver":"https://pith.science/pith/JMX3ETJZW6DIYILNUM5PG7IZAO","bundle":"https://pith.science/pith/JMX3ETJZW6DIYILNUM5PG7IZAO/bundle.json","state":"https://pith.science/pith/JMX3ETJZW6DIYILNUM5PG7IZAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMX3ETJZW6DIYILNUM5PG7IZAO/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6su8AJZf1PSmMjaHdettHTEzJ0xLXtaAxGvgSxgwLa9/BsT2bu/CgCtjICjR0PvFYpGaBOqXdZFiGkcC09mbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T17:21:03.123769Z","bundle_sha256":"347ba3928d6c12510ae27f3b0132704f92aa53784feb1e91ac6b8ecf4a92227c"}}