{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FYZVQER4ICO3OKVICLZIJUHAGN","short_pith_number":"pith:FYZVQER4","canonical_record":{"source":{"id":"1511.05425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-17T14:53:21Z","cross_cats_sorted":[],"title_canon_sha256":"08401902edaabf5142754eca66bcdbf49195065c54ce297eff75bbcb379c4395","abstract_canon_sha256":"2c89d605c82dffa6205bda2fe7d5dd09909d8f02c30eeb089df491f3bfc7a0b8"},"schema_version":"1.0"},"canonical_sha256":"2e3358123c409db72aa812f284d0e0335790aef725e89617c62ddfe353a234e3","source":{"kind":"arxiv","id":"1511.05425","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05425","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05425v2","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05425","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"FYZVQER4ICO3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FYZVQER4ICO3OKVI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FYZVQER4","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FYZVQER4ICO3OKVICLZIJUHAGN","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-17T14:53:21Z","cross_cats_sorted":[],"title_canon_sha256":"08401902edaabf5142754eca66bcdbf49195065c54ce297eff75bbcb379c4395","abstract_canon_sha256":"2c89d605c82dffa6205bda2fe7d5dd09909d8f02c30eeb089df491f3bfc7a0b8"},"schema_version":"1.0"},"canonical_sha256":"2e3358123c409db72aa812f284d0e0335790aef725e89617c62ddfe353a234e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:13.407528Z","signature_b64":"S/qLr7k1coS9cQIgD7fxViCLRHmIZUVmTx0eQjz58EomZYsxJ1j6x709lmQnHOyRLMgN/A3Lq1+kwJub4PaGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e3358123c409db72aa812f284d0e0335790aef725e89617c62ddfe353a234e3","last_reissued_at":"2026-05-18T00:42:13.406800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:13.406800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05425","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-18T00:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F17EUyjUhXMOYq23IdTyEI5XNSPTGTpTY1hl/GqKRtDP3di9rcfaY3ub1TugfR/jBuh8x/PHj/lAwASuSDwzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:27:01.746989Z"},"content_sha256":"ae9557e783a110f5131d808f361203694af940bdaf0588f1fec366a6cef7c615","schema_version":"1.0","event_id":"sha256:ae9557e783a110f5131d808f361203694af940bdaf0588f1fec366a6cef7c615"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FYZVQER4ICO3OKVICLZIJUHAGN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of touching pairs in a set of planar curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'alint Hujter, P\\'eter Gy\\\"orgyi, S\\'andor Kisfaludi-Bak","submitted_at":"2015-11-17T14:53:21Z","abstract_excerpt":"Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$ is the number of faces in the curve arrangement that contains at least one endpoint of one of the curves. Our method relies on finding special subsets of curves called quasi-grids in curve families; this gives some structural insight into curve families with a high number of touchings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05425","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-18T00:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThB8M1ufODVpu+n3wdzTHQY8qBr+lqV5ycG/ftnraV87XADSvp6nZNuID7h3pqO7hCt0gocyDoKxb6uFH+hNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:27:01.747344Z"},"content_sha256":"e8ba1bc765257a2d49847945a0f191cad31bed6c58ec618d9b48b82843968172","schema_version":"1.0","event_id":"sha256:e8ba1bc765257a2d49847945a0f191cad31bed6c58ec618d9b48b82843968172"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYZVQER4ICO3OKVICLZIJUHAGN/bundle.json","state_url":"https://pith.science/pith/FYZVQER4ICO3OKVICLZIJUHAGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYZVQER4ICO3OKVICLZIJUHAGN/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-23T13:27:01Z","links":{"resolver":"https://pith.science/pith/FYZVQER4ICO3OKVICLZIJUHAGN","bundle":"https://pith.science/pith/FYZVQER4ICO3OKVICLZIJUHAGN/bundle.json","state":"https://pith.science/pith/FYZVQER4ICO3OKVICLZIJUHAGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYZVQER4ICO3OKVICLZIJUHAGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FYZVQER4ICO3OKVICLZIJUHAGN","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":"2c89d605c82dffa6205bda2fe7d5dd09909d8f02c30eeb089df491f3bfc7a0b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-17T14:53:21Z","title_canon_sha256":"08401902edaabf5142754eca66bcdbf49195065c54ce297eff75bbcb379c4395"},"schema_version":"1.0","source":{"id":"1511.05425","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05425","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05425v2","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05425","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"FYZVQER4ICO3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FYZVQER4ICO3OKVI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FYZVQER4","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:e8ba1bc765257a2d49847945a0f191cad31bed6c58ec618d9b48b82843968172","target":"graph","created_at":"2026-05-18T00:42:13Z","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":"Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$ is the number of faces in the curve arrangement that contains at least one endpoint of one of the curves. Our method relies on finding special subsets of curves called quasi-grids in curve families; this gives some structural insight into curve families with a high number of touchings.","authors_text":"B\\'alint Hujter, P\\'eter Gy\\\"orgyi, S\\'andor Kisfaludi-Bak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-17T14:53:21Z","title":"On the number of touching pairs in a set of planar curves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05425","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:ae9557e783a110f5131d808f361203694af940bdaf0588f1fec366a6cef7c615","target":"record","created_at":"2026-05-18T00:42:13Z","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":"2c89d605c82dffa6205bda2fe7d5dd09909d8f02c30eeb089df491f3bfc7a0b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-17T14:53:21Z","title_canon_sha256":"08401902edaabf5142754eca66bcdbf49195065c54ce297eff75bbcb379c4395"},"schema_version":"1.0","source":{"id":"1511.05425","kind":"arxiv","version":2}},"canonical_sha256":"2e3358123c409db72aa812f284d0e0335790aef725e89617c62ddfe353a234e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e3358123c409db72aa812f284d0e0335790aef725e89617c62ddfe353a234e3","first_computed_at":"2026-05-18T00:42:13.406800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:13.406800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S/qLr7k1coS9cQIgD7fxViCLRHmIZUVmTx0eQjz58EomZYsxJ1j6x709lmQnHOyRLMgN/A3Lq1+kwJub4PaGAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:13.407528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05425","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae9557e783a110f5131d808f361203694af940bdaf0588f1fec366a6cef7c615","sha256:e8ba1bc765257a2d49847945a0f191cad31bed6c58ec618d9b48b82843968172"],"state_sha256":"3df3676c60a25cb077c31aa755c6864a1d57bacf5f2d0aa374a27f4d411511c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ers2rXYEd2oH18l9zAzmOniazzPm1eux1HpUJK9B6vAbdvmjWvUiKTsQ/HPgJ0vP3KZGzvorj5I5uICtJQ/FBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T13:27:01.749586Z","bundle_sha256":"86f441675ba123ff88d79011d114195e36f56d9343a66d75fec191363ea6f9f9"}}