{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Z27NCSG33L7Q5G4FN326GDG7UA","short_pith_number":"pith:Z27NCSG3","canonical_record":{"source":{"id":"1704.02178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T10:43:25Z","cross_cats_sorted":[],"title_canon_sha256":"9d79488457b01543e153d56f9adc2204f16efe6a9bd7720f4f32519c5fc53c51","abstract_canon_sha256":"6a3a28d1da1b5661a73081cb6ab0f3b35081b5fd5c246f8039700b5c4321b86f"},"schema_version":"1.0"},"canonical_sha256":"cebed148dbdaff0e9b856ef5e30cdfa00c29a232b756807ec2962f179112bdda","source":{"kind":"arxiv","id":"1704.02178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02178","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02178v1","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02178","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"pith_short_12","alias_value":"Z27NCSG33L7Q","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z27NCSG33L7Q5G4F","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z27NCSG3","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Z27NCSG33L7Q5G4FN326GDG7UA","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T10:43:25Z","cross_cats_sorted":[],"title_canon_sha256":"9d79488457b01543e153d56f9adc2204f16efe6a9bd7720f4f32519c5fc53c51","abstract_canon_sha256":"6a3a28d1da1b5661a73081cb6ab0f3b35081b5fd5c246f8039700b5c4321b86f"},"schema_version":"1.0"},"canonical_sha256":"cebed148dbdaff0e9b856ef5e30cdfa00c29a232b756807ec2962f179112bdda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:50.502998Z","signature_b64":"Dfu0NP+EvfCl4Nr826Nwswala3frwypbjBeaeQm2Q5OHTobep+R4kdFSrN8zZYPKfxTLH002UM/ZBoBMBudjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cebed148dbdaff0e9b856ef5e30cdfa00c29a232b756807ec2962f179112bdda","last_reissued_at":"2026-05-18T00:46:50.502404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:50.502404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02178","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-05-18T00:46:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EEaIo3sKWEM4jwyUPk86CrtyIFQfJip7njVubyjjdtzW29rWNBuTWKxIvMP3bcu/XAHRyl9couH+E8leeI8MAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:00:49.685896Z"},"content_sha256":"9c188a2934f709a598056dc031eb6aba432785001846dc2134ae4f1055c989e6","schema_version":"1.0","event_id":"sha256:9c188a2934f709a598056dc031eb6aba432785001846dc2134ae4f1055c989e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Z27NCSG33L7Q5G4FN326GDG7UA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Subquadratic Approximation Algorithms for the Girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Morten St\\\"ockel, S{\\o}ren Dahlgaard","submitted_at":"2017-04-07T10:43:25Z","abstract_excerpt":"We consider the problem of approximating the girth, $g$, of an unweighted and undirected graph $G=(V,E)$ with $n$ nodes and $m$ edges. A seminal result of Itai and Rodeh [SICOMP'78] gave an additive $1$-approximation in $O(n^2)$ time, and the main open question is thus how well we can do in subquadratic time.\n  In this paper we present two main results. The first is a $(1+\\varepsilon,O(1))$-approximation in truly subquadratic time. Specifically, for any $k\\ge 2$ our algorithm returns a cycle of length $2\\lceil g/2\\rceil+2\\left\\lceil\\frac{g}{2(k-1)}\\right\\rceil$ in $\\tilde{O}(n^{2-1/k})$ time. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02178","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":""},"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-05-18T00:46:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PXg2fVF3kFv8FCBBl/VeOdeYaeaUFAjfIDIMPsCFTI9lsAoniVSNlRa3wbNkwo+nXC3QH5GItP87rqdTA8RbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:00:49.686253Z"},"content_sha256":"d2195b4a4906d5225aec6dbd2c840c070c47efe3b41c6ef9e8e1217de4a4ddce","schema_version":"1.0","event_id":"sha256:d2195b4a4906d5225aec6dbd2c840c070c47efe3b41c6ef9e8e1217de4a4ddce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z27NCSG33L7Q5G4FN326GDG7UA/bundle.json","state_url":"https://pith.science/pith/Z27NCSG33L7Q5G4FN326GDG7UA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z27NCSG33L7Q5G4FN326GDG7UA/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-05-30T16:00:49Z","links":{"resolver":"https://pith.science/pith/Z27NCSG33L7Q5G4FN326GDG7UA","bundle":"https://pith.science/pith/Z27NCSG33L7Q5G4FN326GDG7UA/bundle.json","state":"https://pith.science/pith/Z27NCSG33L7Q5G4FN326GDG7UA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z27NCSG33L7Q5G4FN326GDG7UA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z27NCSG33L7Q5G4FN326GDG7UA","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":"6a3a28d1da1b5661a73081cb6ab0f3b35081b5fd5c246f8039700b5c4321b86f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T10:43:25Z","title_canon_sha256":"9d79488457b01543e153d56f9adc2204f16efe6a9bd7720f4f32519c5fc53c51"},"schema_version":"1.0","source":{"id":"1704.02178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02178","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02178v1","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02178","created_at":"2026-05-18T00:46:50Z"},{"alias_kind":"pith_short_12","alias_value":"Z27NCSG33L7Q","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z27NCSG33L7Q5G4F","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z27NCSG3","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:d2195b4a4906d5225aec6dbd2c840c070c47efe3b41c6ef9e8e1217de4a4ddce","target":"graph","created_at":"2026-05-18T00:46:50Z","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"},"paper":{"abstract_excerpt":"We consider the problem of approximating the girth, $g$, of an unweighted and undirected graph $G=(V,E)$ with $n$ nodes and $m$ edges. A seminal result of Itai and Rodeh [SICOMP'78] gave an additive $1$-approximation in $O(n^2)$ time, and the main open question is thus how well we can do in subquadratic time.\n  In this paper we present two main results. The first is a $(1+\\varepsilon,O(1))$-approximation in truly subquadratic time. Specifically, for any $k\\ge 2$ our algorithm returns a cycle of length $2\\lceil g/2\\rceil+2\\left\\lceil\\frac{g}{2(k-1)}\\right\\rceil$ in $\\tilde{O}(n^{2-1/k})$ time. ","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Morten St\\\"ockel, S{\\o}ren Dahlgaard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T10:43:25Z","title":"New Subquadratic Approximation Algorithms for the Girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02178","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:9c188a2934f709a598056dc031eb6aba432785001846dc2134ae4f1055c989e6","target":"record","created_at":"2026-05-18T00:46:50Z","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":"6a3a28d1da1b5661a73081cb6ab0f3b35081b5fd5c246f8039700b5c4321b86f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T10:43:25Z","title_canon_sha256":"9d79488457b01543e153d56f9adc2204f16efe6a9bd7720f4f32519c5fc53c51"},"schema_version":"1.0","source":{"id":"1704.02178","kind":"arxiv","version":1}},"canonical_sha256":"cebed148dbdaff0e9b856ef5e30cdfa00c29a232b756807ec2962f179112bdda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cebed148dbdaff0e9b856ef5e30cdfa00c29a232b756807ec2962f179112bdda","first_computed_at":"2026-05-18T00:46:50.502404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:50.502404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dfu0NP+EvfCl4Nr826Nwswala3frwypbjBeaeQm2Q5OHTobep+R4kdFSrN8zZYPKfxTLH002UM/ZBoBMBudjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:50.502998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c188a2934f709a598056dc031eb6aba432785001846dc2134ae4f1055c989e6","sha256:d2195b4a4906d5225aec6dbd2c840c070c47efe3b41c6ef9e8e1217de4a4ddce"],"state_sha256":"cb025a9caa323bdd3c9863a76f6876b084f2ed2a8bb7404a38d0f12f7e7f95aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4ACQKSkqNPtaWaAFAEosVDCI8BhrpU2mKM2f39nTUmd7aWEcEzbG/gyD9lx8A0KPG4nGVlTC+c7iiZ5klhvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:00:49.688735Z","bundle_sha256":"8d7169e0c7e9fd5638af03c366bc18ae0797fa9785263099fe817c1a913fc91e"}}