{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:S3YPKSLBNBQYV26EYUM6CIGAGV","short_pith_number":"pith:S3YPKSLB","canonical_record":{"source":{"id":"0911.4690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-24T18:13:42Z","cross_cats_sorted":[],"title_canon_sha256":"a3c6876337875c2061a7fcf965554d3ea9d5f9e804e5d2cc86d250eb0f987b12","abstract_canon_sha256":"7c6ecbaf5db6f8895e59df1b4f2a5b213f4a875af1f2b0f1046981c0c1ef0123"},"schema_version":"1.0"},"canonical_sha256":"96f0f5496168618aebc4c519e120c03559ab92158f2b059734332c0ef6dfe064","source":{"kind":"arxiv","id":"0911.4690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4690","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4690v1","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4690","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"S3YPKSLBNBQY","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"S3YPKSLBNBQYV26E","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"S3YPKSLB","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:S3YPKSLBNBQYV26EYUM6CIGAGV","target":"record","payload":{"canonical_record":{"source":{"id":"0911.4690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-24T18:13:42Z","cross_cats_sorted":[],"title_canon_sha256":"a3c6876337875c2061a7fcf965554d3ea9d5f9e804e5d2cc86d250eb0f987b12","abstract_canon_sha256":"7c6ecbaf5db6f8895e59df1b4f2a5b213f4a875af1f2b0f1046981c0c1ef0123"},"schema_version":"1.0"},"canonical_sha256":"96f0f5496168618aebc4c519e120c03559ab92158f2b059734332c0ef6dfe064","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:44.712453Z","signature_b64":"v6BtBKR/mcwYmrs2xV1CRmeaeeqON0ISsd8GuD201lFCP4HwTrQ5zGXyCKKXjZLuoxIxn0wZRqpfpBtLce6EBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96f0f5496168618aebc4c519e120c03559ab92158f2b059734332c0ef6dfe064","last_reissued_at":"2026-05-17T23:47:44.712006Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:44.712006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.4690","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-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SR/zJkde7QpXJ4QY8s1JhGGNPEdYAQ3PTbyEZZUF85/lraPuo3HjGUDVO1OMlF5sY2eKo2ilcM6D+Rff8quPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:34:20.502512Z"},"content_sha256":"c3619417cbbe0e1d9ac2986625b441631d97c7f575eec6837236a7126bbaa64e","schema_version":"1.0","event_id":"sha256:c3619417cbbe0e1d9ac2986625b441631d97c7f575eec6837236a7126bbaa64e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:S3YPKSLBNBQYV26EYUM6CIGAGV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nested cycles in large triangulations and crossing-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cesar Hernandez-Velez, Gelasio Salazar, Robin Thomas","submitted_at":"2009-11-24T18:13:42Z","abstract_excerpt":"We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this result to show that for each fixed positive integer $k$, there are only finitely many $k$-crossing-critical simple graphs of average degree at least six. Combined with the recent constructions of crossing-critical graphs given by Bokal, this settles the question of for which numbers $q>0$ there is an infinite family of $k$-crossing-critical simple graphs of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4690","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-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zm53KrU4CKx16ExADqR4oTaR7wv+soDWqQyTnND0sH3kxspQhwKAXyRhTRtk1e15CV9U6sxTMk5P+YDBOhqbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:34:20.503214Z"},"content_sha256":"80fdf345b11841c6b20205056bbffb67387430973d0c325558fafa2bfc40b0d4","schema_version":"1.0","event_id":"sha256:80fdf345b11841c6b20205056bbffb67387430973d0c325558fafa2bfc40b0d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3YPKSLBNBQYV26EYUM6CIGAGV/bundle.json","state_url":"https://pith.science/pith/S3YPKSLBNBQYV26EYUM6CIGAGV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3YPKSLBNBQYV26EYUM6CIGAGV/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-07T15:34:20Z","links":{"resolver":"https://pith.science/pith/S3YPKSLBNBQYV26EYUM6CIGAGV","bundle":"https://pith.science/pith/S3YPKSLBNBQYV26EYUM6CIGAGV/bundle.json","state":"https://pith.science/pith/S3YPKSLBNBQYV26EYUM6CIGAGV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3YPKSLBNBQYV26EYUM6CIGAGV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:S3YPKSLBNBQYV26EYUM6CIGAGV","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":"7c6ecbaf5db6f8895e59df1b4f2a5b213f4a875af1f2b0f1046981c0c1ef0123","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-24T18:13:42Z","title_canon_sha256":"a3c6876337875c2061a7fcf965554d3ea9d5f9e804e5d2cc86d250eb0f987b12"},"schema_version":"1.0","source":{"id":"0911.4690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4690","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4690v1","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4690","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"S3YPKSLBNBQY","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"S3YPKSLBNBQYV26E","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"S3YPKSLB","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:80fdf345b11841c6b20205056bbffb67387430973d0c325558fafa2bfc40b0d4","target":"graph","created_at":"2026-05-17T23:47:44Z","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 show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this result to show that for each fixed positive integer $k$, there are only finitely many $k$-crossing-critical simple graphs of average degree at least six. Combined with the recent constructions of crossing-critical graphs given by Bokal, this settles the question of for which numbers $q>0$ there is an infinite family of $k$-crossing-critical simple graphs of a","authors_text":"Cesar Hernandez-Velez, Gelasio Salazar, Robin Thomas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-24T18:13:42Z","title":"Nested cycles in large triangulations and crossing-critical graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4690","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:c3619417cbbe0e1d9ac2986625b441631d97c7f575eec6837236a7126bbaa64e","target":"record","created_at":"2026-05-17T23:47:44Z","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":"7c6ecbaf5db6f8895e59df1b4f2a5b213f4a875af1f2b0f1046981c0c1ef0123","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-24T18:13:42Z","title_canon_sha256":"a3c6876337875c2061a7fcf965554d3ea9d5f9e804e5d2cc86d250eb0f987b12"},"schema_version":"1.0","source":{"id":"0911.4690","kind":"arxiv","version":1}},"canonical_sha256":"96f0f5496168618aebc4c519e120c03559ab92158f2b059734332c0ef6dfe064","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96f0f5496168618aebc4c519e120c03559ab92158f2b059734332c0ef6dfe064","first_computed_at":"2026-05-17T23:47:44.712006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:44.712006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v6BtBKR/mcwYmrs2xV1CRmeaeeqON0ISsd8GuD201lFCP4HwTrQ5zGXyCKKXjZLuoxIxn0wZRqpfpBtLce6EBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:44.712453Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.4690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3619417cbbe0e1d9ac2986625b441631d97c7f575eec6837236a7126bbaa64e","sha256:80fdf345b11841c6b20205056bbffb67387430973d0c325558fafa2bfc40b0d4"],"state_sha256":"10c48f0a379e2c59883f6dff99d58198b26cdac0f32e87abadcdd5c9550d7800"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5GUcyH1lENoGtLZxtlRasMMU4M/h2RSTS+/k4JMmnM9KehF7R5I/No2KP+NaBdipBCZkXqFJAkspq/jKX8iBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:34:20.506991Z","bundle_sha256":"840afa66929eea265b0f742b9726f1cec85d14d3dee4395fc1a7b76c23c228ac"}}