{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RFLMYEDKFZ622NK5MTOM4RYIM6","short_pith_number":"pith:RFLMYEDK","canonical_record":{"source":{"id":"1501.06681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-27T08:07:19Z","cross_cats_sorted":[],"title_canon_sha256":"693ac70ea8d342e3363a8ff6739f7409c6cc3f75d3b65515867bd74d59c19229","abstract_canon_sha256":"410a96c808796778b036f211fdefba04d4e159a0e21e76ec9de252c764d42282"},"schema_version":"1.0"},"canonical_sha256":"8956cc106a2e7dad355d64dcce470867a64f9805b3f75f039cc1f87fcde9d840","source":{"kind":"arxiv","id":"1501.06681","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06681","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06681v2","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06681","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"RFLMYEDKFZ62","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFLMYEDKFZ622NK5","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFLMYEDK","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RFLMYEDKFZ622NK5MTOM4RYIM6","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-27T08:07:19Z","cross_cats_sorted":[],"title_canon_sha256":"693ac70ea8d342e3363a8ff6739f7409c6cc3f75d3b65515867bd74d59c19229","abstract_canon_sha256":"410a96c808796778b036f211fdefba04d4e159a0e21e76ec9de252c764d42282"},"schema_version":"1.0"},"canonical_sha256":"8956cc106a2e7dad355d64dcce470867a64f9805b3f75f039cc1f87fcde9d840","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:30.851972Z","signature_b64":"tRlg3seSoqV8t0atW8/DFYaLqAS19jhcCDql/iBc6C+dQMb0rddZgv+9aQOvae4EjKprw2Nx4daSKPJRoRKCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8956cc106a2e7dad355d64dcce470867a64f9805b3f75f039cc1f87fcde9d840","last_reissued_at":"2026-05-18T02:28:30.851353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:30.851353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06681","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:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4g2pSJvldXuGNixV5+IDWcu1p8d/Y6AdnaItupmHjAV9qMcXznFOMKYghm9D31e7xVt+eDQfgSVIUclBlq52DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:03:03.259753Z"},"content_sha256":"1bbb50c0ccff4bf1de8dade6239baab0a1df4bad30754e9d308d38b69a6be4d1","schema_version":"1.0","event_id":"sha256:1bbb50c0ccff4bf1de8dade6239baab0a1df4bad30754e9d308d38b69a6be4d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RFLMYEDKFZ622NK5MTOM4RYIM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"De Bruijn-Erd\\H{o}s type theorems for graphs and posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Casey Tompkins, David Malec, Guillaume Lagarde, Pierre Aboulker","submitted_at":"2015-01-27T08:07:19Z","abstract_excerpt":"A classical theorem of De Bruijn and Erd\\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to comparability graphs, we obtain a version of the De Bruijn-Erd\\H{o}s theorem for partially ordered sets (posets). Moreover, in this case, we have an improved bound on the number of lines depending on the height of the poset. The extremal configurations are also determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06681","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:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2T1nx2GBqE5L9amIDqHntVnrGGykFFo/Joj3IeR88qto0YbMsApfD/LyLPfwimzHeU6TA1hLg0ByXBJwssjqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:03:03.260101Z"},"content_sha256":"72d3a46ca1f2045f0d35c5df7ebe312dfea36ab4149c90cc712bfc8238a16ea7","schema_version":"1.0","event_id":"sha256:72d3a46ca1f2045f0d35c5df7ebe312dfea36ab4149c90cc712bfc8238a16ea7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFLMYEDKFZ622NK5MTOM4RYIM6/bundle.json","state_url":"https://pith.science/pith/RFLMYEDKFZ622NK5MTOM4RYIM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFLMYEDKFZ622NK5MTOM4RYIM6/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-27T13:03:03Z","links":{"resolver":"https://pith.science/pith/RFLMYEDKFZ622NK5MTOM4RYIM6","bundle":"https://pith.science/pith/RFLMYEDKFZ622NK5MTOM4RYIM6/bundle.json","state":"https://pith.science/pith/RFLMYEDKFZ622NK5MTOM4RYIM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFLMYEDKFZ622NK5MTOM4RYIM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RFLMYEDKFZ622NK5MTOM4RYIM6","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":"410a96c808796778b036f211fdefba04d4e159a0e21e76ec9de252c764d42282","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-27T08:07:19Z","title_canon_sha256":"693ac70ea8d342e3363a8ff6739f7409c6cc3f75d3b65515867bd74d59c19229"},"schema_version":"1.0","source":{"id":"1501.06681","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06681","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06681v2","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06681","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"RFLMYEDKFZ62","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFLMYEDKFZ622NK5","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFLMYEDK","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:72d3a46ca1f2045f0d35c5df7ebe312dfea36ab4149c90cc712bfc8238a16ea7","target":"graph","created_at":"2026-05-18T02:28:30Z","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 classical theorem of De Bruijn and Erd\\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to comparability graphs, we obtain a version of the De Bruijn-Erd\\H{o}s theorem for partially ordered sets (posets). Moreover, in this case, we have an improved bound on the number of lines depending on the height of the poset. The extremal configurations are also determined.","authors_text":"Abhishek Methuku, Casey Tompkins, David Malec, Guillaume Lagarde, Pierre Aboulker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-27T08:07:19Z","title":"De Bruijn-Erd\\H{o}s type theorems for graphs and posets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06681","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:1bbb50c0ccff4bf1de8dade6239baab0a1df4bad30754e9d308d38b69a6be4d1","target":"record","created_at":"2026-05-18T02:28:30Z","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":"410a96c808796778b036f211fdefba04d4e159a0e21e76ec9de252c764d42282","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-27T08:07:19Z","title_canon_sha256":"693ac70ea8d342e3363a8ff6739f7409c6cc3f75d3b65515867bd74d59c19229"},"schema_version":"1.0","source":{"id":"1501.06681","kind":"arxiv","version":2}},"canonical_sha256":"8956cc106a2e7dad355d64dcce470867a64f9805b3f75f039cc1f87fcde9d840","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8956cc106a2e7dad355d64dcce470867a64f9805b3f75f039cc1f87fcde9d840","first_computed_at":"2026-05-18T02:28:30.851353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:30.851353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tRlg3seSoqV8t0atW8/DFYaLqAS19jhcCDql/iBc6C+dQMb0rddZgv+9aQOvae4EjKprw2Nx4daSKPJRoRKCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:30.851972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06681","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bbb50c0ccff4bf1de8dade6239baab0a1df4bad30754e9d308d38b69a6be4d1","sha256:72d3a46ca1f2045f0d35c5df7ebe312dfea36ab4149c90cc712bfc8238a16ea7"],"state_sha256":"ce71df3b927209577461b8f5f366e0154fbf81fa88f2ba44376a8c4da7c491d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R9jctx1mOEKC3vbSo9S3TaBbKGl3lVnPJG0XqHETmbkVk1a56qOZHRkLokWfyuPIhxvrNvzbfkL7MYDHw/VXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:03:03.262570Z","bundle_sha256":"a40b433461bc08bbd0900ff70f1bf427220b1a6798fa314d940539a2507dc4df"}}