{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I7YSGATFKI5E4CP24CUX5GOKAA","short_pith_number":"pith:I7YSGATF","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"},"canonical_sha256":"47f1230265523a4e09fae0a97e99ca002788ed1d013cd2a2cc10bbffedc34810","source":{"kind":"arxiv","id":"1803.07515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07515","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07515v1","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07515","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"pith_short_12","alias_value":"I7YSGATFKI5E","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I7YSGATFKI5E4CP2","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I7YSGATF","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I7YSGATFKI5E4CP24CUX5GOKAA","target":"record","payload":{"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"},"canonical_sha256":"47f1230265523a4e09fae0a97e99ca002788ed1d013cd2a2cc10bbffedc34810","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"},"source_kind":"arxiv","source_id":"1803.07515","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:20:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUBvOz9epKbKVg1L879mvVHP8lXPGDBilV1VezWOALMdA4yssAz5Tl36GyZAkTA727zPQ1PUWI9dwsPeowXJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:24:11.149928Z"},"content_sha256":"8676efed33730ea257d727961eda1cb708697e990665bedea894b1f030b022c5","schema_version":"1.0","event_id":"sha256:8676efed33730ea257d727961eda1cb708697e990665bedea894b1f030b022c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I7YSGATFKI5E4CP24CUX5GOKAA","target":"graph","payload":{"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"},"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:20:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9gOAWLVk7C08MuQB2JTIG5jITMqZdZpE0JSoyQouZ8Pq1qP3HnruQEnf35EAhSrWFPajcaInlwSQKndqzeKZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:24:11.150283Z"},"content_sha256":"b056975750e8296ddd29c938d7b871ea62594b6922cf77bdef05bfffd0099d1a","schema_version":"1.0","event_id":"sha256:b056975750e8296ddd29c938d7b871ea62594b6922cf77bdef05bfffd0099d1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA/bundle.json","state_url":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7YSGATFKI5E4CP24CUX5GOKAA/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-07-03T11:24:11Z","links":{"resolver":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA","bundle":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA/bundle.json","state":"https://pith.science/pith/I7YSGATFKI5E4CP24CUX5GOKAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7YSGATFKI5E4CP24CUX5GOKAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I7YSGATFKI5E4CP24CUX5GOKAA","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":"424bb2b33a7f8d45d8eb3f57da03c2bb04f42a8d13e7e243e448be4e591ccc4d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-20T16:40:07Z","title_canon_sha256":"c20853fbce5b9b1c8514377106a8ce54485932ed34c9df37f339bddcbf825373"},"schema_version":"1.0","source":{"id":"1803.07515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07515","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07515v1","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07515","created_at":"2026-05-18T00:20:32Z"},{"alias_kind":"pith_short_12","alias_value":"I7YSGATFKI5E","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I7YSGATFKI5E4CP2","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I7YSGATF","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:b056975750e8296ddd29c938d7b871ea62594b6922cf77bdef05bfffd0099d1a","target":"graph","created_at":"2026-05-18T00:20:32Z","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":"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","authors_text":"Lutz Oettershagen, Petra Mutzel","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-20T16:40:07Z","title":"The Crossing Number of Seq-Shellable Drawings of Complete Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07515","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:8676efed33730ea257d727961eda1cb708697e990665bedea894b1f030b022c5","target":"record","created_at":"2026-05-18T00:20:32Z","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":"424bb2b33a7f8d45d8eb3f57da03c2bb04f42a8d13e7e243e448be4e591ccc4d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-20T16:40:07Z","title_canon_sha256":"c20853fbce5b9b1c8514377106a8ce54485932ed34c9df37f339bddcbf825373"},"schema_version":"1.0","source":{"id":"1803.07515","kind":"arxiv","version":1}},"canonical_sha256":"47f1230265523a4e09fae0a97e99ca002788ed1d013cd2a2cc10bbffedc34810","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47f1230265523a4e09fae0a97e99ca002788ed1d013cd2a2cc10bbffedc34810","first_computed_at":"2026-05-18T00:20:32.938951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:32.938951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W/+fp4QuP6XoCTwMcsSpw6HYgTBM1hOR+lFWrm2LsXndWldrHjkrSUfj67769RS+99EoYqKfjzgUkeNXvFuCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:32.939510Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8676efed33730ea257d727961eda1cb708697e990665bedea894b1f030b022c5","sha256:b056975750e8296ddd29c938d7b871ea62594b6922cf77bdef05bfffd0099d1a"],"state_sha256":"edc42f39bec88bca7ce344f4b92ee68e686b4b174e43c12481990cf46ea1a530"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQ1E56I0CmqbPheIsqoI8cIw0d9j11N+R+WF8lWoi1K2z5LUC3BMtiT7+1GDxN2uOW6foCc4pb51tCdxTzDNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T11:24:11.152333Z","bundle_sha256":"72f44f4d0a50d3900f9e472bb90b9f8deaaaf05edafca29786f6d1c0fc5e5174"}}