{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:I7YSGATFKI5E4CP24CUX5GOKAA","short_pith_number":"pith:I7YSGATF","schema_version":"1.0","canonical_sha256":"47f1230265523a4e09fae0a97e99ca002788ed1d013cd2a2cc10bbffedc34810","source":{"kind":"arxiv","id":"1803.07515","version":1},"attestation_state":"computed","paper":{"title":"The Crossing Number of Seq-Shellable Drawings of Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Lutz Oettershagen, Petra Mutzel","submitted_at":"2018-03-20T16:40:07Z","abstract_excerpt":"The Harary-Hill conjecture states that for every $n>0$ the complete graph on $n$ vertices $K_n$, the minimum number of crossings over all its possible drawings equals \\begin{align*} H(n) := \\frac{1}{4}\\Big\\lfloor\\frac{n}{2}\\Big\\rfloor\\Big\\lfloor\\frac{n-1}{2}\\Big\\rfloor\\Big\\lfloor\\frac{n-2}{2}\\Big\\rfloor\\Big\\lfloor\\frac{n-3}{2}\\Big\\rfloor\\text{.} \\end{align*} So far, the lower bound of the conjecture could only be verified for arbitrary drawings of $K_n$ with $n\\leq 12$. In recent years, progress has been made in verifying the conjecture for certain classes of drawings, for example $2$-page-boo"},"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":"1803.07515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-20T16:40:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c20853fbce5b9b1c8514377106a8ce54485932ed34c9df37f339bddcbf825373","abstract_canon_sha256":"424bb2b33a7f8d45d8eb3f57da03c2bb04f42a8d13e7e243e448be4e591ccc4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:32.939510Z","signature_b64":"W/+fp4QuP6XoCTwMcsSpw6HYgTBM1hOR+lFWrm2LsXndWldrHjkrSUfj67769RS+99EoYqKfjzgUkeNXvFuCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47f1230265523a4e09fae0a97e99ca002788ed1d013cd2a2cc10bbffedc34810","last_reissued_at":"2026-05-18T00:20:32.938951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:32.938951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Crossing Number of Seq-Shellable Drawings of Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Lutz Oettershagen, Petra Mutzel","submitted_at":"2018-03-20T16:40:07Z","abstract_excerpt":"The Harary-Hill conjecture states that for every $n>0$ the complete graph on $n$ vertices $K_n$, the minimum number of crossings over all its possible drawings equals \\begin{align*} H(n) := \\frac{1}{4}\\Big\\lfloor\\frac{n}{2}\\Big\\rfloor\\Big\\lfloor\\frac{n-1}{2}\\Big\\rfloor\\Big\\lfloor\\frac{n-2}{2}\\Big\\rfloor\\Big\\lfloor\\frac{n-3}{2}\\Big\\rfloor\\text{.} \\end{align*} So far, the lower bound of the conjecture could only be verified for arbitrary drawings of $K_n$ with $n\\leq 12$. In recent years, progress has been made in verifying the conjecture for certain classes of drawings, for example $2$-page-boo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07515","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":"1803.07515","created_at":"2026-05-18T00:20:32.939021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.07515v1","created_at":"2026-05-18T00:20:32.939021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07515","created_at":"2026-05-18T00:20:32.939021+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7YSGATFKI5E","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7YSGATFKI5E4CP2","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7YSGATF","created_at":"2026-05-18T12:32:28.185984+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/I7YSGATFKI5E4CP24CUX5GOKAA","json":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA.json","graph_json":"https://pith.science/api/pith-number/I7YSGATFKI5E4CP24CUX5GOKAA/graph.json","events_json":"https://pith.science/api/pith-number/I7YSGATFKI5E4CP24CUX5GOKAA/events.json","paper":"https://pith.science/paper/I7YSGATF"},"agent_actions":{"view_html":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA","download_json":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA.json","view_paper":"https://pith.science/paper/I7YSGATF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.07515&json=true","fetch_graph":"https://pith.science/api/pith-number/I7YSGATFKI5E4CP24CUX5GOKAA/graph.json","fetch_events":"https://pith.science/api/pith-number/I7YSGATFKI5E4CP24CUX5GOKAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA/action/storage_attestation","attest_author":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA/action/author_attestation","sign_citation":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA/action/citation_signature","submit_replication":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA/action/replication_record"}},"created_at":"2026-05-18T00:20:32.939021+00:00","updated_at":"2026-05-18T00:20:32.939021+00:00"}