{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:GZA6R2EIA6OJ4EHNM54Y5SWYXP","short_pith_number":"pith:GZA6R2EI","canonical_record":{"source":{"id":"1010.2167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-11T17:35:02Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"a40ea4a1291dcdab863e5c4df5ae077fc40ed45faa4da6790ca1ca95c20c96da","abstract_canon_sha256":"d220521a8b8c6b0196784c4ecd7d0bbed1b61338c9d83a766a3c3b47e5045434"},"schema_version":"1.0"},"canonical_sha256":"3641e8e888079c9e10ed67798ecad8bbc446f484b797bd5e38802b41381e5b60","source":{"kind":"arxiv","id":"1010.2167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2167","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2167v1","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2167","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"GZA6R2EIA6OJ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GZA6R2EIA6OJ4EHN","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GZA6R2EI","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:GZA6R2EIA6OJ4EHNM54Y5SWYXP","target":"record","payload":{"canonical_record":{"source":{"id":"1010.2167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-11T17:35:02Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"a40ea4a1291dcdab863e5c4df5ae077fc40ed45faa4da6790ca1ca95c20c96da","abstract_canon_sha256":"d220521a8b8c6b0196784c4ecd7d0bbed1b61338c9d83a766a3c3b47e5045434"},"schema_version":"1.0"},"canonical_sha256":"3641e8e888079c9e10ed67798ecad8bbc446f484b797bd5e38802b41381e5b60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:54.650330Z","signature_b64":"RVscZFRo6+VWZheuNR1ognvdb4Cs7opOIeKaxwq3fPcHE7x/rFX+kxSNQjCMoyFVHtvTSlwBCEk0ux7jSWj7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3641e8e888079c9e10ed67798ecad8bbc446f484b797bd5e38802b41381e5b60","last_reissued_at":"2026-05-18T04:03:54.649805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:54.649805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.2167","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-18T04:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AuU1OBvfEJf0DuTFXAtEAbY2FeD2ROWI5I0MHUKVIfisDgk3Bh36S9KfZ36dG0gBcRxQPShbUciO2r1TRVZmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:13:18.808236Z"},"content_sha256":"f799bb7a6b27aa3c042fa73378b411f507d0ff6cd5c9fd39ef357401e9804e89","schema_version":"1.0","event_id":"sha256:f799bb7a6b27aa3c042fa73378b411f507d0ff6cd5c9fd39ef357401e9804e89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:GZA6R2EIA6OJ4EHNM54Y5SWYXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey-type constructions for arrangements of segments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Jan Kyn\\v{c}l","submitted_at":"2010-10-11T17:35:02Z","abstract_excerpt":"Improving a result of K\\'arolyi, Pach and T\\'oth, we construct an arrangement of $n$ segments in the plane with at most $n^{\\log{8} / \\log{169}}$ pairwise crossing or pairwise disjoint segments. We use the recursive method based on flattenable arrangements which was established by Larman, Matou\\v{s}ek, Pach and T\\\"or\\H{o}csik. We also show that not every arrangement can be flattened, by constructing an intersection graph of segments which cannot be realized by an arrangement of segments crossing a common line. Moreover, we also construct an intersection graph of segments crossing a common line"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2167","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-18T04:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HWNbF3oBr2GRuAKtrBhol4Cp9yfAUXtcry/xPz3Ri+EG6wsdukRtVRI7QP2P6IRXSN90KvGWL7S9oZcEXDcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:13:18.808905Z"},"content_sha256":"0e9547e6624ca50031e73cf5b9be98cf5ba23b8115c6580a6bb0dbea28034155","schema_version":"1.0","event_id":"sha256:0e9547e6624ca50031e73cf5b9be98cf5ba23b8115c6580a6bb0dbea28034155"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZA6R2EIA6OJ4EHNM54Y5SWYXP/bundle.json","state_url":"https://pith.science/pith/GZA6R2EIA6OJ4EHNM54Y5SWYXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZA6R2EIA6OJ4EHNM54Y5SWYXP/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-30T22:13:18Z","links":{"resolver":"https://pith.science/pith/GZA6R2EIA6OJ4EHNM54Y5SWYXP","bundle":"https://pith.science/pith/GZA6R2EIA6OJ4EHNM54Y5SWYXP/bundle.json","state":"https://pith.science/pith/GZA6R2EIA6OJ4EHNM54Y5SWYXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZA6R2EIA6OJ4EHNM54Y5SWYXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:GZA6R2EIA6OJ4EHNM54Y5SWYXP","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":"d220521a8b8c6b0196784c4ecd7d0bbed1b61338c9d83a766a3c3b47e5045434","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-11T17:35:02Z","title_canon_sha256":"a40ea4a1291dcdab863e5c4df5ae077fc40ed45faa4da6790ca1ca95c20c96da"},"schema_version":"1.0","source":{"id":"1010.2167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2167","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2167v1","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2167","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"GZA6R2EIA6OJ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GZA6R2EIA6OJ4EHN","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GZA6R2EI","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:0e9547e6624ca50031e73cf5b9be98cf5ba23b8115c6580a6bb0dbea28034155","target":"graph","created_at":"2026-05-18T04:03:54Z","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":"Improving a result of K\\'arolyi, Pach and T\\'oth, we construct an arrangement of $n$ segments in the plane with at most $n^{\\log{8} / \\log{169}}$ pairwise crossing or pairwise disjoint segments. We use the recursive method based on flattenable arrangements which was established by Larman, Matou\\v{s}ek, Pach and T\\\"or\\H{o}csik. We also show that not every arrangement can be flattened, by constructing an intersection graph of segments which cannot be realized by an arrangement of segments crossing a common line. Moreover, we also construct an intersection graph of segments crossing a common line","authors_text":"Jan Kyn\\v{c}l","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-11T17:35:02Z","title":"Ramsey-type constructions for arrangements of segments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2167","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:f799bb7a6b27aa3c042fa73378b411f507d0ff6cd5c9fd39ef357401e9804e89","target":"record","created_at":"2026-05-18T04:03:54Z","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":"d220521a8b8c6b0196784c4ecd7d0bbed1b61338c9d83a766a3c3b47e5045434","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-11T17:35:02Z","title_canon_sha256":"a40ea4a1291dcdab863e5c4df5ae077fc40ed45faa4da6790ca1ca95c20c96da"},"schema_version":"1.0","source":{"id":"1010.2167","kind":"arxiv","version":1}},"canonical_sha256":"3641e8e888079c9e10ed67798ecad8bbc446f484b797bd5e38802b41381e5b60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3641e8e888079c9e10ed67798ecad8bbc446f484b797bd5e38802b41381e5b60","first_computed_at":"2026-05-18T04:03:54.649805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:54.649805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RVscZFRo6+VWZheuNR1ognvdb4Cs7opOIeKaxwq3fPcHE7x/rFX+kxSNQjCMoyFVHtvTSlwBCEk0ux7jSWj7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:54.650330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f799bb7a6b27aa3c042fa73378b411f507d0ff6cd5c9fd39ef357401e9804e89","sha256:0e9547e6624ca50031e73cf5b9be98cf5ba23b8115c6580a6bb0dbea28034155"],"state_sha256":"67b35fd33facbef179b86256d1150ca8c06ca85ea842673129fe37a4447d1f12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCE6Imwwj1O1Wz38KPnz0VMcoF1+FOWPm7bsOtvsbq1nxdd2qb8DGh052SX7xbSX9SFU56/4okPaimXA+YqlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:13:18.811966Z","bundle_sha256":"ff84d661d399dfddecc9ba50677fd7742d9a9aecac571c3b695b11266bc99999"}}