{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U4ECIUOKPOXV3UGHVZT2ZNXTSW","short_pith_number":"pith:U4ECIUOK","schema_version":"1.0","canonical_sha256":"a7082451ca7baf5dd0c7ae67acb6f395bb18a9be6730735393837e7539c66066","source":{"kind":"arxiv","id":"1105.4770","version":1},"attestation_state":"computed","paper":{"title":"Minimum diameter and cycle-diameter orientations on planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Nili Guttmann-Beck, Refael Hassin","submitted_at":"2011-05-24T14:04:00Z","abstract_excerpt":"Let G be an edge weighted undirected graph. For every pair of nodes consider the shortest cycle containing these nodes in G. The cycle diameter of G is the maximum length of a cycle in this set. Let H be a directed graph obtained by directing the edges of G. The cycle diameter of H is similarly defined except for that cycles are replaced by directed closed walks. Is there always an orientation H of G whose cycle diameter is bounded by a constant times the cycle diameter of G? We prove this property for planar graphs. These results have implications on the problem of approximating an orientatio"},"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":"1105.4770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-24T14:04:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cccb5da9953a9a83426e3818b39c4ffae58f233b833bf0419f3e0d2b30e45525","abstract_canon_sha256":"28e9e00283188e63e0aa889c01e1fc0a7e0d3074efed12729dda2f63eb9f9ef7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:21.824067Z","signature_b64":"fwjg6M88s7Uq/9wibWnas5CHi2HNfojJ/HYemhevP79RTL0TJ6BIYV4JBeowqspB+OW2GPj0cVZYVrrqquESBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7082451ca7baf5dd0c7ae67acb6f395bb18a9be6730735393837e7539c66066","last_reissued_at":"2026-05-18T04:21:21.823666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:21.823666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum diameter and cycle-diameter orientations on planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Nili Guttmann-Beck, Refael Hassin","submitted_at":"2011-05-24T14:04:00Z","abstract_excerpt":"Let G be an edge weighted undirected graph. For every pair of nodes consider the shortest cycle containing these nodes in G. The cycle diameter of G is the maximum length of a cycle in this set. Let H be a directed graph obtained by directing the edges of G. The cycle diameter of H is similarly defined except for that cycles are replaced by directed closed walks. Is there always an orientation H of G whose cycle diameter is bounded by a constant times the cycle diameter of G? We prove this property for planar graphs. These results have implications on the problem of approximating an orientatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4770","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.4770","created_at":"2026-05-18T04:21:21.823725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.4770v1","created_at":"2026-05-18T04:21:21.823725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4770","created_at":"2026-05-18T04:21:21.823725+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4ECIUOKPOXV","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4ECIUOKPOXV3UGH","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4ECIUOK","created_at":"2026-05-18T12:26:42.757692+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/U4ECIUOKPOXV3UGHVZT2ZNXTSW","json":"https://pith.science/pith/U4ECIUOKPOXV3UGHVZT2ZNXTSW.json","graph_json":"https://pith.science/api/pith-number/U4ECIUOKPOXV3UGHVZT2ZNXTSW/graph.json","events_json":"https://pith.science/api/pith-number/U4ECIUOKPOXV3UGHVZT2ZNXTSW/events.json","paper":"https://pith.science/paper/U4ECIUOK"},"agent_actions":{"view_html":"https://pith.science/pith/U4ECIUOKPOXV3UGHVZT2ZNXTSW","download_json":"https://pith.science/pith/U4ECIUOKPOXV3UGHVZT2ZNXTSW.json","view_paper":"https://pith.science/paper/U4ECIUOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.4770&json=true","fetch_graph":"https://pith.science/api/pith-number/U4ECIUOKPOXV3UGHVZT2ZNXTSW/graph.json","fetch_events":"https://pith.science/api/pith-number/U4ECIUOKPOXV3UGHVZT2ZNXTSW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4ECIUOKPOXV3UGHVZT2ZNXTSW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4ECIUOKPOXV3UGHVZT2ZNXTSW/action/storage_attestation","attest_author":"https://pith.science/pith/U4ECIUOKPOXV3UGHVZT2ZNXTSW/action/author_attestation","sign_citation":"https://pith.science/pith/U4ECIUOKPOXV3UGHVZT2ZNXTSW/action/citation_signature","submit_replication":"https://pith.science/pith/U4ECIUOKPOXV3UGHVZT2ZNXTSW/action/replication_record"}},"created_at":"2026-05-18T04:21:21.823725+00:00","updated_at":"2026-05-18T04:21:21.823725+00:00"}