{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VXMMKZBIU446O54HG2VI6ZTUPJ","short_pith_number":"pith:VXMMKZBI","schema_version":"1.0","canonical_sha256":"add8c56428a739e7778736aa8f66747a4ea7322043dec99be9e578284b3c57bb","source":{"kind":"arxiv","id":"1808.08996","version":1},"attestation_state":"computed","paper":{"title":"A Size Condition for Diameter Two Orientable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Eva Czabarka, Garner Cochran, L\\'aszl\\'o Sz\\'ekely, Peter Dankelmann","submitted_at":"2018-08-27T19:03:00Z","abstract_excerpt":"It was conjectured by Koh and Tay [Graphs Combin. 18(4) (2002), 745--756] that for $n\\geq 5$ every simple graph of order $n$ and size at least $\\binom{n}{2}-n+5$ has an orientation of diameter two. We prove this conjecture and hence determine for every $n\\geq 5$ the minimum value of $m$ such that every graph of order $n$ and size $m$ has an orientation of diameter two."},"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":"1808.08996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-27T19:03:00Z","cross_cats_sorted":[],"title_canon_sha256":"095045c1377359384a049596ee7d28913b4d6a7a6838c387e47919e2d9f0ca3f","abstract_canon_sha256":"4f7029642da317fee6e775777b824af97795133918c79c5bef805d0b3641beb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:04.942635Z","signature_b64":"fL5zVFhRYN35TkRhGfy5rMF8JigSwtfyZ7FKKT+c0HK37Eptaz35vtL2UDBJzRGc7g+mo3gtYxfWkCiigOVaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"add8c56428a739e7778736aa8f66747a4ea7322043dec99be9e578284b3c57bb","last_reissued_at":"2026-05-18T00:07:04.942083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:04.942083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Size Condition for Diameter Two Orientable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Eva Czabarka, Garner Cochran, L\\'aszl\\'o Sz\\'ekely, Peter Dankelmann","submitted_at":"2018-08-27T19:03:00Z","abstract_excerpt":"It was conjectured by Koh and Tay [Graphs Combin. 18(4) (2002), 745--756] that for $n\\geq 5$ every simple graph of order $n$ and size at least $\\binom{n}{2}-n+5$ has an orientation of diameter two. We prove this conjecture and hence determine for every $n\\geq 5$ the minimum value of $m$ such that every graph of order $n$ and size $m$ has an orientation of diameter two."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08996","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":"1808.08996","created_at":"2026-05-18T00:07:04.942162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08996v1","created_at":"2026-05-18T00:07:04.942162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08996","created_at":"2026-05-18T00:07:04.942162+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXMMKZBIU446","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXMMKZBIU446O54H","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXMMKZBI","created_at":"2026-05-18T12:32:59.047623+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/VXMMKZBIU446O54HG2VI6ZTUPJ","json":"https://pith.science/pith/VXMMKZBIU446O54HG2VI6ZTUPJ.json","graph_json":"https://pith.science/api/pith-number/VXMMKZBIU446O54HG2VI6ZTUPJ/graph.json","events_json":"https://pith.science/api/pith-number/VXMMKZBIU446O54HG2VI6ZTUPJ/events.json","paper":"https://pith.science/paper/VXMMKZBI"},"agent_actions":{"view_html":"https://pith.science/pith/VXMMKZBIU446O54HG2VI6ZTUPJ","download_json":"https://pith.science/pith/VXMMKZBIU446O54HG2VI6ZTUPJ.json","view_paper":"https://pith.science/paper/VXMMKZBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08996&json=true","fetch_graph":"https://pith.science/api/pith-number/VXMMKZBIU446O54HG2VI6ZTUPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VXMMKZBIU446O54HG2VI6ZTUPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXMMKZBIU446O54HG2VI6ZTUPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXMMKZBIU446O54HG2VI6ZTUPJ/action/storage_attestation","attest_author":"https://pith.science/pith/VXMMKZBIU446O54HG2VI6ZTUPJ/action/author_attestation","sign_citation":"https://pith.science/pith/VXMMKZBIU446O54HG2VI6ZTUPJ/action/citation_signature","submit_replication":"https://pith.science/pith/VXMMKZBIU446O54HG2VI6ZTUPJ/action/replication_record"}},"created_at":"2026-05-18T00:07:04.942162+00:00","updated_at":"2026-05-18T00:07:04.942162+00:00"}