{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:BM4GDHOZ6THNJYY4FA3BNF64Y6","short_pith_number":"pith:BM4GDHOZ","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"},"canonical_sha256":"0b38619dd9f4ced4e31c28361697dcc7a968275609757706e4ccb90cb45670ac","source":{"kind":"arxiv","id":"1002.4231","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.4231","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1002.4231v2","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.4231","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"BM4GDHOZ6THN","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BM4GDHOZ6THNJYY4","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BM4GDHOZ","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:BM4GDHOZ6THNJYY4FA3BNF64Y6","target":"record","payload":{"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"},"canonical_sha256":"0b38619dd9f4ced4e31c28361697dcc7a968275609757706e4ccb90cb45670ac","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"},"source_kind":"arxiv","source_id":"1002.4231","source_version":2,"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-18T04:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PGKfCU+b/dj8mYVhyeVQ8yeOwyp2qxHk+8cN75k/4AEHZAB0EVn5iuNYifPheYIB6WLE2944BVPdhtpeJSvABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:33:31.886266Z"},"content_sha256":"7dc6e10fbf765d5e2eb4a699f683fd828b580b04b0933f0b2520963e35f22ca2","schema_version":"1.0","event_id":"sha256:7dc6e10fbf765d5e2eb4a699f683fd828b580b04b0933f0b2520963e35f22ca2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:BM4GDHOZ6THNJYY4FA3BNF64Y6","target":"graph","payload":{"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"},"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-18T04:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70xS0c9lvOZT/iyaKXkADVPqwuGsmHLmfub0ItWWi5H6Ee4YfRto3gX3Y06vCH4djzmIgc/H0JUYRc0k4o1LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:33:31.886875Z"},"content_sha256":"d5f2d18a5ef5f94ea51332a3a5937cf71273f62104cfddaf0f7eaf9017760fc4","schema_version":"1.0","event_id":"sha256:d5f2d18a5ef5f94ea51332a3a5937cf71273f62104cfddaf0f7eaf9017760fc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6/bundle.json","state_url":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6/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-06-08T01:33:31Z","links":{"resolver":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6","bundle":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6/bundle.json","state":"https://pith.science/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BM4GDHOZ6THNJYY4FA3BNF64Y6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:BM4GDHOZ6THNJYY4FA3BNF64Y6","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":"dacb46b9f82677051b4de31af03cc162668e0425df9266feab244b8e114413d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-23T01:08:01Z","title_canon_sha256":"21bc5441f351f1a8ee95fcc5aaedcc2675801e47b32124e3cd0a373b46aafd3c"},"schema_version":"1.0","source":{"id":"1002.4231","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.4231","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1002.4231v2","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.4231","created_at":"2026-05-18T04:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"BM4GDHOZ6THN","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BM4GDHOZ6THNJYY4","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BM4GDHOZ","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:d5f2d18a5ef5f94ea51332a3a5937cf71273f62104cfddaf0f7eaf9017760fc4","target":"graph","created_at":"2026-05-18T04:04:43Z","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":"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.","authors_text":"Hiroyuki Tanaka, Masakazu Teragaito","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-23T01:08:01Z","title":"Triple crossing numbers of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.4231","kind":"arxiv","version":2},"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:7dc6e10fbf765d5e2eb4a699f683fd828b580b04b0933f0b2520963e35f22ca2","target":"record","created_at":"2026-05-18T04:04:43Z","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":"dacb46b9f82677051b4de31af03cc162668e0425df9266feab244b8e114413d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-23T01:08:01Z","title_canon_sha256":"21bc5441f351f1a8ee95fcc5aaedcc2675801e47b32124e3cd0a373b46aafd3c"},"schema_version":"1.0","source":{"id":"1002.4231","kind":"arxiv","version":2}},"canonical_sha256":"0b38619dd9f4ced4e31c28361697dcc7a968275609757706e4ccb90cb45670ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b38619dd9f4ced4e31c28361697dcc7a968275609757706e4ccb90cb45670ac","first_computed_at":"2026-05-18T04:04:43.843534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:43.843534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fBI8TGejxoNk7aA37CHbTqFEwLSsxyOID1oBbfU0PBLq5BrZ24A/9gy3tAiRXyUp9F+jMnHIkvAq55TthkriCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:43.844450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.4231","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dc6e10fbf765d5e2eb4a699f683fd828b580b04b0933f0b2520963e35f22ca2","sha256:d5f2d18a5ef5f94ea51332a3a5937cf71273f62104cfddaf0f7eaf9017760fc4"],"state_sha256":"10e3b883a42ab6f3e90634b4167afbcdba14cb7e4b4eca011594df8a906e000f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyf9Vyw1O0dLphWCQGRHc7Vq1OLRyKyxS6rk63gLCDDKExFYqczhuo/O80COJ4SyesP+ZnW7I2W2axby/oypAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:33:31.890340Z","bundle_sha256":"c49067fa13c6a71b421fdc2731d92620fd6ecbbc3e74ec24c05690b5c59f2378"}}