{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TT6IWMPKP6KXNJ2B5V226QKQBQ","short_pith_number":"pith:TT6IWMPK","schema_version":"1.0","canonical_sha256":"9cfc8b31ea7f9576a741ed75af41500c340fa58846386ea00b04e0a386aa2788","source":{"kind":"arxiv","id":"1112.3167","version":3},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.3167","created_at":"2026-05-18T04:06:07.381331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.3167v3","created_at":"2026-05-18T04:06:07.381331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3167","created_at":"2026-05-18T04:06:07.381331+00:00"},{"alias_kind":"pith_short_12","alias_value":"TT6IWMPKP6KX","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TT6IWMPKP6KXNJ2B","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TT6IWMPK","created_at":"2026-05-18T12:26:42.757692+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/TT6IWMPKP6KXNJ2B5V226QKQBQ","json":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ.json","graph_json":"https://pith.science/api/pith-number/TT6IWMPKP6KXNJ2B5V226QKQBQ/graph.json","events_json":"https://pith.science/api/pith-number/TT6IWMPKP6KXNJ2B5V226QKQBQ/events.json","paper":"https://pith.science/paper/TT6IWMPK"},"agent_actions":{"view_html":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ","download_json":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ.json","view_paper":"https://pith.science/paper/TT6IWMPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.3167&json=true","fetch_graph":"https://pith.science/api/pith-number/TT6IWMPKP6KXNJ2B5V226QKQBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TT6IWMPKP6KXNJ2B5V226QKQBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ/action/storage_attestation","attest_author":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ/action/author_attestation","sign_citation":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ/action/citation_signature","submit_replication":"https://pith.science/pith/TT6IWMPKP6KXNJ2B5V226QKQBQ/action/replication_record"}},"created_at":"2026-05-18T04:06:07.381331+00:00","updated_at":"2026-05-18T04:06:07.381331+00:00"}