{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4TEXRCDWFVFZJWTMKZWHNGHTKI","short_pith_number":"pith:4TEXRCDW","canonical_record":{"source":{"id":"1202.1870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-09T01:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"8913f573a6884cb465febd054815830ed2b7e44a158233a284930e29ac54ff45","abstract_canon_sha256":"e18b343c0d8ff55c6a878d22ba30350c09bb0a61423aedc21474738c0464e7ad"},"schema_version":"1.0"},"canonical_sha256":"e4c97888762d4b94da6c566c7698f352382a9515807b47a7e84522bc88539eae","source":{"kind":"arxiv","id":"1202.1870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1870","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1870v1","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1870","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"4TEXRCDWFVFZ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4TEXRCDWFVFZJWTM","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4TEXRCDW","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4TEXRCDWFVFZJWTMKZWHNGHTKI","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-09T01:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"8913f573a6884cb465febd054815830ed2b7e44a158233a284930e29ac54ff45","abstract_canon_sha256":"e18b343c0d8ff55c6a878d22ba30350c09bb0a61423aedc21474738c0464e7ad"},"schema_version":"1.0"},"canonical_sha256":"e4c97888762d4b94da6c566c7698f352382a9515807b47a7e84522bc88539eae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:38.910390Z","signature_b64":"ZUFpkntrQ7uNKfy5Tb46w6sqLZvw/4ZwCE9TE+AxgKU3+ukXhfl0FhU/7p4VS7ewY7FlDtzLwK6GLCyCQZBRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4c97888762d4b94da6c566c7698f352382a9515807b47a7e84522bc88539eae","last_reissued_at":"2026-05-18T04:02:38.909687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:38.909687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1870","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-18T04:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sd+9nah4oT8uYdU8MtiJLbWx8faUYiOXrbzEUxYjsG+HLEU/asuQX7e5voyPia5Yf6dmVItnNylZFdokwaxQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:17:28.044526Z"},"content_sha256":"61a25e70f3664a29391df86a473750a9b8ef48956e0688a58f37582e227e9b4b","schema_version":"1.0","event_id":"sha256:61a25e70f3664a29391df86a473750a9b8ef48956e0688a58f37582e227e9b4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4TEXRCDWFVFZJWTMKZWHNGHTKI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The thickness of cartesian product $K_n \\Box P_m$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yan Yang","submitted_at":"2012-02-09T01:57:00Z","abstract_excerpt":"The thickness $\\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. It is a topological invariant of a graph, which was defined by W.T. Tutte in 1963 and also has important applications to VLSI design. But comparing with other topological invariants, e.g. genus and crossing number, results about thickness of graphs are few. The only types of graphs whose thicknesses have been obtained are complete graphs, complete bipartite graphs and hypercubes. In this paper, by operations on graphs, the thickness of the cartesian product $K"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1870","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-18T04:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+dqR8sCkwzT0/tJ0l2rjOMymE5xvbawYb2UIQE8CAUI/k6toePFOi92BXnbNzB3DN6UheXeMFrZnj16Rgvs2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:17:28.045133Z"},"content_sha256":"d9ab467747ee9df451dc2092be44f219df3f1540c8f686c1cdc52356627551bd","schema_version":"1.0","event_id":"sha256:d9ab467747ee9df451dc2092be44f219df3f1540c8f686c1cdc52356627551bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TEXRCDWFVFZJWTMKZWHNGHTKI/bundle.json","state_url":"https://pith.science/pith/4TEXRCDWFVFZJWTMKZWHNGHTKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TEXRCDWFVFZJWTMKZWHNGHTKI/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-05-18T22:17:28Z","links":{"resolver":"https://pith.science/pith/4TEXRCDWFVFZJWTMKZWHNGHTKI","bundle":"https://pith.science/pith/4TEXRCDWFVFZJWTMKZWHNGHTKI/bundle.json","state":"https://pith.science/pith/4TEXRCDWFVFZJWTMKZWHNGHTKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TEXRCDWFVFZJWTMKZWHNGHTKI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4TEXRCDWFVFZJWTMKZWHNGHTKI","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":"e18b343c0d8ff55c6a878d22ba30350c09bb0a61423aedc21474738c0464e7ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-09T01:57:00Z","title_canon_sha256":"8913f573a6884cb465febd054815830ed2b7e44a158233a284930e29ac54ff45"},"schema_version":"1.0","source":{"id":"1202.1870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1870","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1870v1","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1870","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"4TEXRCDWFVFZ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4TEXRCDWFVFZJWTM","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4TEXRCDW","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:d9ab467747ee9df451dc2092be44f219df3f1540c8f686c1cdc52356627551bd","target":"graph","created_at":"2026-05-18T04:02:38Z","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 thickness $\\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. It is a topological invariant of a graph, which was defined by W.T. Tutte in 1963 and also has important applications to VLSI design. But comparing with other topological invariants, e.g. genus and crossing number, results about thickness of graphs are few. The only types of graphs whose thicknesses have been obtained are complete graphs, complete bipartite graphs and hypercubes. In this paper, by operations on graphs, the thickness of the cartesian product $K","authors_text":"Yan Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-09T01:57:00Z","title":"The thickness of cartesian product $K_n \\Box P_m$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1870","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:61a25e70f3664a29391df86a473750a9b8ef48956e0688a58f37582e227e9b4b","target":"record","created_at":"2026-05-18T04:02:38Z","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":"e18b343c0d8ff55c6a878d22ba30350c09bb0a61423aedc21474738c0464e7ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-09T01:57:00Z","title_canon_sha256":"8913f573a6884cb465febd054815830ed2b7e44a158233a284930e29ac54ff45"},"schema_version":"1.0","source":{"id":"1202.1870","kind":"arxiv","version":1}},"canonical_sha256":"e4c97888762d4b94da6c566c7698f352382a9515807b47a7e84522bc88539eae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4c97888762d4b94da6c566c7698f352382a9515807b47a7e84522bc88539eae","first_computed_at":"2026-05-18T04:02:38.909687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:38.909687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZUFpkntrQ7uNKfy5Tb46w6sqLZvw/4ZwCE9TE+AxgKU3+ukXhfl0FhU/7p4VS7ewY7FlDtzLwK6GLCyCQZBRCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:38.910390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61a25e70f3664a29391df86a473750a9b8ef48956e0688a58f37582e227e9b4b","sha256:d9ab467747ee9df451dc2092be44f219df3f1540c8f686c1cdc52356627551bd"],"state_sha256":"547a3a779822f08c940c1edd18126af944d398fec1b03cfa541cc1ae371258f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rg3os2M6cLqar4W+KVHYgCJ2pMUI57jpPF/qkbPmsuhyrAI+9XZYmUcYF2YazdZBhfGh6NZ3NBoEM7k9yCavDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T22:17:28.046994Z","bundle_sha256":"2f9e03ca022d6ea9f43c354b8c9efe58a267d2482f4a9681b5c8e49813834d6b"}}