{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UNRRXQ4SZWAUKTXRBJFSLMA33S","short_pith_number":"pith:UNRRXQ4S","canonical_record":{"source":{"id":"1309.1046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T14:31:32Z","cross_cats_sorted":[],"title_canon_sha256":"312e7048c479f55b9177298cdb99ce99d286f4dcaef9bf4df4ac3c939a1d090e","abstract_canon_sha256":"578a6139f39078eb2f2089823a3d318e345b9ac52c9f921eabc1d775e72473a4"},"schema_version":"1.0"},"canonical_sha256":"a3631bc392cd81454ef10a4b25b01bdcb6b5488b1d502fd79a9d7736cd27405f","source":{"kind":"arxiv","id":"1309.1046","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1046","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1046v2","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1046","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"UNRRXQ4SZWAU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UNRRXQ4SZWAUKTXR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UNRRXQ4S","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UNRRXQ4SZWAUKTXRBJFSLMA33S","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T14:31:32Z","cross_cats_sorted":[],"title_canon_sha256":"312e7048c479f55b9177298cdb99ce99d286f4dcaef9bf4df4ac3c939a1d090e","abstract_canon_sha256":"578a6139f39078eb2f2089823a3d318e345b9ac52c9f921eabc1d775e72473a4"},"schema_version":"1.0"},"canonical_sha256":"a3631bc392cd81454ef10a4b25b01bdcb6b5488b1d502fd79a9d7736cd27405f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:29.357181Z","signature_b64":"2CQDUyIgXXLRgcMC6Ipz1mEvKMQzfmSEv8vFld8+bamC9XSAo8+4WKWzF8eYQjIuhRfveKXdnZif7Oq4O9VpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3631bc392cd81454ef10a4b25b01bdcb6b5488b1d502fd79a9d7736cd27405f","last_reissued_at":"2026-05-18T02:28:29.356651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:29.356651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1046","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-18T02:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18cmGgaGwr1RG+6t3KwZg1fb9eAfDrXs3e9i74Aj6DKO19mZSSm7gIhplIvb9dXE2EXiulXluOSl8pzTjMqhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:57:59.635797Z"},"content_sha256":"697cfa9df1a9d4d8089e354035a8512c7d8ccbe67d02955f840c1b8281530a7f","schema_version":"1.0","event_id":"sha256:697cfa9df1a9d4d8089e354035a8512c7d8ccbe67d02955f840c1b8281530a7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UNRRXQ4SZWAUKTXRBJFSLMA33S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Saturated simple and $k$-simple topological graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G\\'eza T\\'oth, Jan Kyn\\v{c}l, J\\'anos Pach, Rado\\v{s} Radoi\\v{c}i\\'c","submitted_at":"2013-09-04T14:31:32Z","abstract_excerpt":"A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without violating this condition. We construct saturated simple topological graphs with $n$ vertices and $O(n)$ edges. For every $k>1$, we give similar constructions for $k$-simple topological graphs, that is, for graphs drawn in the plane so that any two edges have at most $k$ points in common. We show that in any $k$-simple topological graph, any two independent vertic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1046","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-18T02:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0/vw58p2REIWQOQUniixpdkDDoyxDnTJZplL+ajuIZIVi3M5Q0Le1qPVSCDI5UY4GuosUxuDNBnA7RWpoiahBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:57:59.636397Z"},"content_sha256":"38d4832b25db734ffbd30113a668a0b5deacb4679238470307d5ba15edae80ce","schema_version":"1.0","event_id":"sha256:38d4832b25db734ffbd30113a668a0b5deacb4679238470307d5ba15edae80ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNRRXQ4SZWAUKTXRBJFSLMA33S/bundle.json","state_url":"https://pith.science/pith/UNRRXQ4SZWAUKTXRBJFSLMA33S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNRRXQ4SZWAUKTXRBJFSLMA33S/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-31T12:57:59Z","links":{"resolver":"https://pith.science/pith/UNRRXQ4SZWAUKTXRBJFSLMA33S","bundle":"https://pith.science/pith/UNRRXQ4SZWAUKTXRBJFSLMA33S/bundle.json","state":"https://pith.science/pith/UNRRXQ4SZWAUKTXRBJFSLMA33S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNRRXQ4SZWAUKTXRBJFSLMA33S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UNRRXQ4SZWAUKTXRBJFSLMA33S","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":"578a6139f39078eb2f2089823a3d318e345b9ac52c9f921eabc1d775e72473a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T14:31:32Z","title_canon_sha256":"312e7048c479f55b9177298cdb99ce99d286f4dcaef9bf4df4ac3c939a1d090e"},"schema_version":"1.0","source":{"id":"1309.1046","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1046","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1046v2","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1046","created_at":"2026-05-18T02:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"UNRRXQ4SZWAU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UNRRXQ4SZWAUKTXR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UNRRXQ4S","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:38d4832b25db734ffbd30113a668a0b5deacb4679238470307d5ba15edae80ce","target":"graph","created_at":"2026-05-18T02:28:29Z","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 simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without violating this condition. We construct saturated simple topological graphs with $n$ vertices and $O(n)$ edges. For every $k>1$, we give similar constructions for $k$-simple topological graphs, that is, for graphs drawn in the plane so that any two edges have at most $k$ points in common. We show that in any $k$-simple topological graph, any two independent vertic","authors_text":"G\\'eza T\\'oth, Jan Kyn\\v{c}l, J\\'anos Pach, Rado\\v{s} Radoi\\v{c}i\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T14:31:32Z","title":"Saturated simple and $k$-simple topological graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1046","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:697cfa9df1a9d4d8089e354035a8512c7d8ccbe67d02955f840c1b8281530a7f","target":"record","created_at":"2026-05-18T02:28:29Z","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":"578a6139f39078eb2f2089823a3d318e345b9ac52c9f921eabc1d775e72473a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T14:31:32Z","title_canon_sha256":"312e7048c479f55b9177298cdb99ce99d286f4dcaef9bf4df4ac3c939a1d090e"},"schema_version":"1.0","source":{"id":"1309.1046","kind":"arxiv","version":2}},"canonical_sha256":"a3631bc392cd81454ef10a4b25b01bdcb6b5488b1d502fd79a9d7736cd27405f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3631bc392cd81454ef10a4b25b01bdcb6b5488b1d502fd79a9d7736cd27405f","first_computed_at":"2026-05-18T02:28:29.356651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:29.356651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2CQDUyIgXXLRgcMC6Ipz1mEvKMQzfmSEv8vFld8+bamC9XSAo8+4WKWzF8eYQjIuhRfveKXdnZif7Oq4O9VpBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:29.357181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1046","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:697cfa9df1a9d4d8089e354035a8512c7d8ccbe67d02955f840c1b8281530a7f","sha256:38d4832b25db734ffbd30113a668a0b5deacb4679238470307d5ba15edae80ce"],"state_sha256":"958663f0f8d880c0d4cda19e62849829ddf82fdc5dfc62138c1e643fbab23600"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JNR5p8q+n+rLyTfdmsVGHQiBkS880QDzrAOnnIVDuQduzSWnI/beV2yYCsXqfAFW4F6LLKySIqUM7/Y9oZ9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:57:59.639827Z","bundle_sha256":"a837b8c9c4bb35a15b897bf4d766451a13ba222f31bccb6394ddf6a729357474"}}