{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TT6IWMPKP6KXNJ2B5V226QKQBQ","short_pith_number":"pith:TT6IWMPK","canonical_record":{"source":{"id":"1112.3167","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-14T11:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"0e88ea1285ef24b236f714796f70870fb9e1cc2d347a656eed5aec1796c267ea","abstract_canon_sha256":"f51bbf4f90967438f06451abd130c4d1b43680b7a73746749ed9f8618da9a1ff"},"schema_version":"1.0"},"canonical_sha256":"9cfc8b31ea7f9576a741ed75af41500c340fa58846386ea00b04e0a386aa2788","source":{"kind":"arxiv","id":"1112.3167","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3167","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3167v3","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3167","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"pith_short_12","alias_value":"TT6IWMPKP6KX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TT6IWMPKP6KXNJ2B","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TT6IWMPK","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TT6IWMPKP6KXNJ2B5V226QKQBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1112.3167","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-14T11:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"0e88ea1285ef24b236f714796f70870fb9e1cc2d347a656eed5aec1796c267ea","abstract_canon_sha256":"f51bbf4f90967438f06451abd130c4d1b43680b7a73746749ed9f8618da9a1ff"},"schema_version":"1.0"},"canonical_sha256":"9cfc8b31ea7f9576a741ed75af41500c340fa58846386ea00b04e0a386aa2788","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:07.381894Z","signature_b64":"LBUHxMFnm3xq0tOq81iHpV5cUwwvMfnA3pjN1FBzZQqFdNM0ywkp57H2tGyxkw7zDnnr4MIb3bnz18+PwIBHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cfc8b31ea7f9576a741ed75af41500c340fa58846386ea00b04e0a386aa2788","last_reissued_at":"2026-05-18T04:06:07.381219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:07.381219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.3167","source_version":3,"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:06:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"THS1kDpqnH37vinBXSDJdAilYQbyPP9c0bOiUi+KwyRK/gpfVxbsGl9n33jsXv2lIK3isZXw0dDXZ/XYEplkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:02:43.596672Z"},"content_sha256":"210a0147736bce4b067fc69b521be4bd9e60f553a365b0d3c86375c2ef2a3fdf","schema_version":"1.0","event_id":"sha256:210a0147736bce4b067fc69b521be4bd9e60f553a365b0d3c86375c2ef2a3fdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TT6IWMPKP6KXNJ2B5V226QKQBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Making a graph crossing-critical by multiplying its edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\'esar Hern\\'andez-V\\'elez, Gelasio Salazar, Laurent Beaudou","submitted_at":"2011-12-14T11:10:28Z","abstract_excerpt":"A graph is crossing-critical if the removal of any of its edges decreases its crossing number. This work is motivated by the following question: to what extent is crossing- criticality a property that is inherent to the structure of a graph, and to what extent can it be induced on a noncritical graph by multiplying (all or some of) its edges? It is shown that if a nonplanar graph G is obtained by adding an edge to a cubic polyhedral graph, and G is sufficiently connected, then G can be made crossing-critical by a suitable multiplication of edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3167","kind":"arxiv","version":3},"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:06:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0ZNKy9XIt8EA9UABokEjHfkQ++dCuZ7+RHSQ6s9t2qO9GPWZ7JJo2606gCeMAVUMhg+ySU5VIM1acQx7YMUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:02:43.597040Z"},"content_sha256":"5fd827ecafa0ff60f5cf5de4850fb224e81751c253219aa1db0b7004a3b64e8a","schema_version":"1.0","event_id":"sha256:5fd827ecafa0ff60f5cf5de4850fb224e81751c253219aa1db0b7004a3b64e8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ/bundle.json","state_url":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ/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-11T09:02:43Z","links":{"resolver":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ","bundle":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ/bundle.json","state":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TT6IWMPKP6KXNJ2B5V226QKQBQ","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":"f51bbf4f90967438f06451abd130c4d1b43680b7a73746749ed9f8618da9a1ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-14T11:10:28Z","title_canon_sha256":"0e88ea1285ef24b236f714796f70870fb9e1cc2d347a656eed5aec1796c267ea"},"schema_version":"1.0","source":{"id":"1112.3167","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3167","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3167v3","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3167","created_at":"2026-05-18T04:06:07Z"},{"alias_kind":"pith_short_12","alias_value":"TT6IWMPKP6KX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TT6IWMPKP6KXNJ2B","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TT6IWMPK","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:5fd827ecafa0ff60f5cf5de4850fb224e81751c253219aa1db0b7004a3b64e8a","target":"graph","created_at":"2026-05-18T04:06:07Z","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":"A graph is crossing-critical if the removal of any of its edges decreases its crossing number. This work is motivated by the following question: to what extent is crossing- criticality a property that is inherent to the structure of a graph, and to what extent can it be induced on a noncritical graph by multiplying (all or some of) its edges? It is shown that if a nonplanar graph G is obtained by adding an edge to a cubic polyhedral graph, and G is sufficiently connected, then G can be made crossing-critical by a suitable multiplication of edges.","authors_text":"C\\'esar Hern\\'andez-V\\'elez, Gelasio Salazar, Laurent Beaudou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-14T11:10:28Z","title":"Making a graph crossing-critical by multiplying its edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3167","kind":"arxiv","version":3},"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:210a0147736bce4b067fc69b521be4bd9e60f553a365b0d3c86375c2ef2a3fdf","target":"record","created_at":"2026-05-18T04:06:07Z","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":"f51bbf4f90967438f06451abd130c4d1b43680b7a73746749ed9f8618da9a1ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-14T11:10:28Z","title_canon_sha256":"0e88ea1285ef24b236f714796f70870fb9e1cc2d347a656eed5aec1796c267ea"},"schema_version":"1.0","source":{"id":"1112.3167","kind":"arxiv","version":3}},"canonical_sha256":"9cfc8b31ea7f9576a741ed75af41500c340fa58846386ea00b04e0a386aa2788","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cfc8b31ea7f9576a741ed75af41500c340fa58846386ea00b04e0a386aa2788","first_computed_at":"2026-05-18T04:06:07.381219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:07.381219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LBUHxMFnm3xq0tOq81iHpV5cUwwvMfnA3pjN1FBzZQqFdNM0ywkp57H2tGyxkw7zDnnr4MIb3bnz18+PwIBHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:07.381894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.3167","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:210a0147736bce4b067fc69b521be4bd9e60f553a365b0d3c86375c2ef2a3fdf","sha256:5fd827ecafa0ff60f5cf5de4850fb224e81751c253219aa1db0b7004a3b64e8a"],"state_sha256":"04c14b7cc351aefec603f773861d51ba3bb490ea3a2b7bfd8b27bff90423666d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KVnIe/5DTR8r7Cl63OdIrrdy/SmFYR3/hALb/CUydzMY0H1tOrqdg2gDVBqzeRkbFEKh0RgDuabDCIHxtk/dDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:02:43.599148Z","bundle_sha256":"6125d151f3dff291c9f5044451a492e360bfacdabc54ac6a817a9845ce04bc89"}}