{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZJ73UZBL23AEITI3RQCIGNVS6F","short_pith_number":"pith:ZJ73UZBL","canonical_record":{"source":{"id":"2312.01028","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-02T04:37:15Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"0bc03bf2e5e279ba5560a8748627ae84ea52130efff1689f44868ccb2b0d8191","abstract_canon_sha256":"4f00821bff388e0693deaf7796d6e83df5be51cb0a04b4e42dc0c3148af37f23"},"schema_version":"1.0"},"canonical_sha256":"ca7fba642bd6c0444d1b8c048336b2f15d5ab1d180be1a9ab9f0b1331c662fd6","source":{"kind":"arxiv","id":"2312.01028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.01028","created_at":"2026-07-05T07:19:28Z"},{"alias_kind":"arxiv_version","alias_value":"2312.01028v1","created_at":"2026-07-05T07:19:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.01028","created_at":"2026-07-05T07:19:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZJ73UZBL23AE","created_at":"2026-07-05T07:19:28Z"},{"alias_kind":"pith_short_16","alias_value":"ZJ73UZBL23AEITI3","created_at":"2026-07-05T07:19:28Z"},{"alias_kind":"pith_short_8","alias_value":"ZJ73UZBL","created_at":"2026-07-05T07:19:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZJ73UZBL23AEITI3RQCIGNVS6F","target":"record","payload":{"canonical_record":{"source":{"id":"2312.01028","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-02T04:37:15Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"0bc03bf2e5e279ba5560a8748627ae84ea52130efff1689f44868ccb2b0d8191","abstract_canon_sha256":"4f00821bff388e0693deaf7796d6e83df5be51cb0a04b4e42dc0c3148af37f23"},"schema_version":"1.0"},"canonical_sha256":"ca7fba642bd6c0444d1b8c048336b2f15d5ab1d180be1a9ab9f0b1331c662fd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:19:28.165505Z","signature_b64":"bmmzNynrWvIGvaV8KpVAk0gw1pXEqpwwNyo3U69MfhP4Wk+vPJ+G6CmKGF2TR9xaOlZAbik8K2YboN7BsSLvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca7fba642bd6c0444d1b8c048336b2f15d5ab1d180be1a9ab9f0b1331c662fd6","last_reissued_at":"2026-07-05T07:19:28.165068Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:19:28.165068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.01028","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-07-05T07:19:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOtGg00ZFK6jBd5ggMF3B6Vh6HK10n8n8YspwOOtJeDcbLRXBreKwUlPoUk0pGwA10YYd/2UuHeuYxKp8BBBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:27:52.296349Z"},"content_sha256":"aae4464548d76a3a2047937fee2a9c735255d9709346113a1276e03f448fa404","schema_version":"1.0","event_id":"sha256:aae4464548d76a3a2047937fee2a9c735255d9709346113a1276e03f448fa404"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZJ73UZBL23AEITI3RQCIGNVS6F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A structure theorem for pseudo-segments and its applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Andrew Suk, Jacob Fox, Janos Pach","submitted_at":"2023-12-02T04:37:15Z","abstract_excerpt":"We prove a far-reaching strengthening of Szemer\\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such that almost all bipartite graphs between different pairs of parts are complete or empty. We use this to get an improved bound on disjoint edges in simple topological graphs, showing that every $n$-vertex simple topological graph with no $k$ pairwise disjoint edges has at most $n(\\log n)^{O(\\log k)}$ edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.01028","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.01028/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:19:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6MY35Y5Q39g43s3sNhrEv14dBNnr2oN54TpZvEaolSsOSHRElL3aKCT0JKNcE/8qIoCa/tSTx+6WRlhv34PCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:27:52.296842Z"},"content_sha256":"0074f749760dd93a628f25738756cb1370c3cef999e9b2394c4dce6665b52aa8","schema_version":"1.0","event_id":"sha256:0074f749760dd93a628f25738756cb1370c3cef999e9b2394c4dce6665b52aa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJ73UZBL23AEITI3RQCIGNVS6F/bundle.json","state_url":"https://pith.science/pith/ZJ73UZBL23AEITI3RQCIGNVS6F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJ73UZBL23AEITI3RQCIGNVS6F/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-08-09T05:27:52Z","links":{"resolver":"https://pith.science/pith/ZJ73UZBL23AEITI3RQCIGNVS6F","bundle":"https://pith.science/pith/ZJ73UZBL23AEITI3RQCIGNVS6F/bundle.json","state":"https://pith.science/pith/ZJ73UZBL23AEITI3RQCIGNVS6F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJ73UZBL23AEITI3RQCIGNVS6F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZJ73UZBL23AEITI3RQCIGNVS6F","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":"4f00821bff388e0693deaf7796d6e83df5be51cb0a04b4e42dc0c3148af37f23","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-02T04:37:15Z","title_canon_sha256":"0bc03bf2e5e279ba5560a8748627ae84ea52130efff1689f44868ccb2b0d8191"},"schema_version":"1.0","source":{"id":"2312.01028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.01028","created_at":"2026-07-05T07:19:28Z"},{"alias_kind":"arxiv_version","alias_value":"2312.01028v1","created_at":"2026-07-05T07:19:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.01028","created_at":"2026-07-05T07:19:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZJ73UZBL23AE","created_at":"2026-07-05T07:19:28Z"},{"alias_kind":"pith_short_16","alias_value":"ZJ73UZBL23AEITI3","created_at":"2026-07-05T07:19:28Z"},{"alias_kind":"pith_short_8","alias_value":"ZJ73UZBL","created_at":"2026-07-05T07:19:28Z"}],"graph_snapshots":[{"event_id":"sha256:0074f749760dd93a628f25738756cb1370c3cef999e9b2394c4dce6665b52aa8","target":"graph","created_at":"2026-07-05T07:19:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.01028/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove a far-reaching strengthening of Szemer\\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such that almost all bipartite graphs between different pairs of parts are complete or empty. We use this to get an improved bound on disjoint edges in simple topological graphs, showing that every $n$-vertex simple topological graph with no $k$ pairwise disjoint edges has at most $n(\\log n)^{O(\\log k)}$ edges.","authors_text":"Andrew Suk, Jacob Fox, Janos Pach","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-02T04:37:15Z","title":"A structure theorem for pseudo-segments and its applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.01028","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:aae4464548d76a3a2047937fee2a9c735255d9709346113a1276e03f448fa404","target":"record","created_at":"2026-07-05T07:19:28Z","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":"4f00821bff388e0693deaf7796d6e83df5be51cb0a04b4e42dc0c3148af37f23","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-02T04:37:15Z","title_canon_sha256":"0bc03bf2e5e279ba5560a8748627ae84ea52130efff1689f44868ccb2b0d8191"},"schema_version":"1.0","source":{"id":"2312.01028","kind":"arxiv","version":1}},"canonical_sha256":"ca7fba642bd6c0444d1b8c048336b2f15d5ab1d180be1a9ab9f0b1331c662fd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca7fba642bd6c0444d1b8c048336b2f15d5ab1d180be1a9ab9f0b1331c662fd6","first_computed_at":"2026-07-05T07:19:28.165068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:19:28.165068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bmmzNynrWvIGvaV8KpVAk0gw1pXEqpwwNyo3U69MfhP4Wk+vPJ+G6CmKGF2TR9xaOlZAbik8K2YboN7BsSLvAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:19:28.165505Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.01028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aae4464548d76a3a2047937fee2a9c735255d9709346113a1276e03f448fa404","sha256:0074f749760dd93a628f25738756cb1370c3cef999e9b2394c4dce6665b52aa8"],"state_sha256":"118274c50b68ddec1b8a58416d77dee3190d6d65e5ca8d118d99ef3715782e81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xx8AaGiM4CLGFapc8mz++vjbW+HTDygF7UiYNuGsEgg2lU4Fmr9XkFvnbaaoVGer2BnsaSZxTDwfS+RvykGjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T05:27:52.302139Z","bundle_sha256":"04c3ec1039afca2d4065d63ef22d6eb7d2b86f510f9bf2869ce34289693078ea"}}