{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Z3JNA3E6X52GC4TARWBHEEJF4R","short_pith_number":"pith:Z3JNA3E6","schema_version":"1.0","canonical_sha256":"ced2d06c9ebf746172608d82721125e47702a4c469788ad124aadc1875d869a0","source":{"kind":"arxiv","id":"1104.4892","version":2},"attestation_state":"computed","paper":{"title":"Computing the Girth of a Planar Graph in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hsien-Chih Chang, Hsueh-I Lu","submitted_at":"2011-04-26T11:44:19Z","abstract_excerpt":"The girth of a graph is the minimum weight of all simple cycles of the graph. We study the problem of determining the girth of an n-node unweighted undirected planar graph. The first non-trivial algorithm for the problem, given by Djidjev, runs in O(n^{5/4} log n) time. Chalermsook, Fakcharoenphol, and Nanongkai reduced the running time to O(n log^2 n). Weimann and Yuster further reduced the running time to O(n log n). In this paper, we solve the problem in O(n) time."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1104.4892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-26T11:44:19Z","cross_cats_sorted":[],"title_canon_sha256":"2fec8a1a57a726caa88d45a37d38e49236245a7d0b672239a10e17a2541227a5","abstract_canon_sha256":"0e120650eecc79665461dfaf658d31c6ad57b523cae2e571cfdb6de038bde3ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:57.449126Z","signature_b64":"fv09IcB+elhgW4HRMn1vfG68Astk/ZdjFot0sOGyCOGy0bhWyeknv70iW5mi0JAutB+N0uz4PoD46sE/YRNSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ced2d06c9ebf746172608d82721125e47702a4c469788ad124aadc1875d869a0","last_reissued_at":"2026-05-18T02:27:57.448496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:57.448496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Girth of a Planar Graph in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hsien-Chih Chang, Hsueh-I Lu","submitted_at":"2011-04-26T11:44:19Z","abstract_excerpt":"The girth of a graph is the minimum weight of all simple cycles of the graph. We study the problem of determining the girth of an n-node unweighted undirected planar graph. The first non-trivial algorithm for the problem, given by Djidjev, runs in O(n^{5/4} log n) time. Chalermsook, Fakcharoenphol, and Nanongkai reduced the running time to O(n log^2 n). Weimann and Yuster further reduced the running time to O(n log n). In this paper, we solve the problem in O(n) time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4892","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.4892","created_at":"2026-05-18T02:27:57.448593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4892v2","created_at":"2026-05-18T02:27:57.448593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4892","created_at":"2026-05-18T02:27:57.448593+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3JNA3E6X52G","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3JNA3E6X52GC4TA","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3JNA3E6","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z3JNA3E6X52GC4TARWBHEEJF4R","json":"https://pith.science/pith/Z3JNA3E6X52GC4TARWBHEEJF4R.json","graph_json":"https://pith.science/api/pith-number/Z3JNA3E6X52GC4TARWBHEEJF4R/graph.json","events_json":"https://pith.science/api/pith-number/Z3JNA3E6X52GC4TARWBHEEJF4R/events.json","paper":"https://pith.science/paper/Z3JNA3E6"},"agent_actions":{"view_html":"https://pith.science/pith/Z3JNA3E6X52GC4TARWBHEEJF4R","download_json":"https://pith.science/pith/Z3JNA3E6X52GC4TARWBHEEJF4R.json","view_paper":"https://pith.science/paper/Z3JNA3E6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4892&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3JNA3E6X52GC4TARWBHEEJF4R/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3JNA3E6X52GC4TARWBHEEJF4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3JNA3E6X52GC4TARWBHEEJF4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3JNA3E6X52GC4TARWBHEEJF4R/action/storage_attestation","attest_author":"https://pith.science/pith/Z3JNA3E6X52GC4TARWBHEEJF4R/action/author_attestation","sign_citation":"https://pith.science/pith/Z3JNA3E6X52GC4TARWBHEEJF4R/action/citation_signature","submit_replication":"https://pith.science/pith/Z3JNA3E6X52GC4TARWBHEEJF4R/action/replication_record"}},"created_at":"2026-05-18T02:27:57.448593+00:00","updated_at":"2026-05-18T02:27:57.448593+00:00"}