{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:BM4GDHOZ6THNJYY4FA3BNF64Y6","short_pith_number":"pith:BM4GDHOZ","schema_version":"1.0","canonical_sha256":"0b38619dd9f4ced4e31c28361697dcc7a968275609757706e4ccb90cb45670ac","source":{"kind":"arxiv","id":"1002.4231","version":2},"attestation_state":"computed","paper":{"title":"Triple crossing numbers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiroyuki Tanaka, Masakazu Teragaito","submitted_at":"2010-02-23T01:08:01Z","abstract_excerpt":"We introduce the triple crossing number, a variation of crossing number, of a graph, which is the minimal number of crossing points in all drawings with only triple crossings of the graph. It is defined to be zero for a planar graph, and to be infinite unless a graph admits a drawing with only triple crossings. In this paper, we determine the triple crossing numbers for all complete multipartite graphs including all complete graphs."},"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":"1002.4231","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-23T01:08:01Z","cross_cats_sorted":[],"title_canon_sha256":"21bc5441f351f1a8ee95fcc5aaedcc2675801e47b32124e3cd0a373b46aafd3c","abstract_canon_sha256":"dacb46b9f82677051b4de31af03cc162668e0425df9266feab244b8e114413d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:43.844450Z","signature_b64":"fBI8TGejxoNk7aA37CHbTqFEwLSsxyOID1oBbfU0PBLq5BrZ24A/9gy3tAiRXyUp9F+jMnHIkvAq55TthkriCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b38619dd9f4ced4e31c28361697dcc7a968275609757706e4ccb90cb45670ac","last_reissued_at":"2026-05-18T04:04:43.843534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:43.843534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triple crossing numbers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiroyuki Tanaka, Masakazu Teragaito","submitted_at":"2010-02-23T01:08:01Z","abstract_excerpt":"We introduce the triple crossing number, a variation of crossing number, of a graph, which is the minimal number of crossing points in all drawings with only triple crossings of the graph. It is defined to be zero for a planar graph, and to be infinite unless a graph admits a drawing with only triple crossings. In this paper, we determine the triple crossing numbers for all complete multipartite graphs including all complete graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.4231","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":"1002.4231","created_at":"2026-05-18T04:04:43.843659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.4231v2","created_at":"2026-05-18T04:04:43.843659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.4231","created_at":"2026-05-18T04:04:43.843659+00:00"},{"alias_kind":"pith_short_12","alias_value":"BM4GDHOZ6THN","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BM4GDHOZ6THNJYY4","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BM4GDHOZ","created_at":"2026-05-18T12:26:05.355336+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/BM4GDHOZ6THNJYY4FA3BNF64Y6","json":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6.json","graph_json":"https://pith.science/api/pith-number/BM4GDHOZ6THNJYY4FA3BNF64Y6/graph.json","events_json":"https://pith.science/api/pith-number/BM4GDHOZ6THNJYY4FA3BNF64Y6/events.json","paper":"https://pith.science/paper/BM4GDHOZ"},"agent_actions":{"view_html":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6","download_json":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6.json","view_paper":"https://pith.science/paper/BM4GDHOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.4231&json=true","fetch_graph":"https://pith.science/api/pith-number/BM4GDHOZ6THNJYY4FA3BNF64Y6/graph.json","fetch_events":"https://pith.science/api/pith-number/BM4GDHOZ6THNJYY4FA3BNF64Y6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6/action/storage_attestation","attest_author":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6/action/author_attestation","sign_citation":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6/action/citation_signature","submit_replication":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6/action/replication_record"}},"created_at":"2026-05-18T04:04:43.843659+00:00","updated_at":"2026-05-18T04:04:43.843659+00:00"}