{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IAOOQW5LJJXIZADGDHA2GR55QT","short_pith_number":"pith:IAOOQW5L","schema_version":"1.0","canonical_sha256":"401ce85bab4a6e8c806619c1a347bd84c244622644eeb62e00630d493f6c85bb","source":{"kind":"arxiv","id":"1205.1170","version":1},"attestation_state":"computed","paper":{"title":"A De Bruijn-Erdos theorem for 1-2 metric spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vasek Chvatal","submitted_at":"2012-05-06T01:32:07Z","abstract_excerpt":"A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in metric spaces with appropriately defined lines. We prove this generalization in all metric spaces where each nonzero distance equals 1 or 2."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1205.1170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-06T01:32:07Z","cross_cats_sorted":[],"title_canon_sha256":"665f45dad78e8672d0b52fd36e6d3d83ef141469c1b1e43c63a3cbefebed519c","abstract_canon_sha256":"198cef968d9578aa06afd343434a60d76aa42800ee1e4b489d8f0feb3210cae1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:54.412084Z","signature_b64":"hiQEXD0Kbqi0CJZQgO+4JB2uprm+mDKHFJVh0togpVRo3Vr/eA8KST8vYVor9hgz9FMcVt2QHpBdF4Gh92QtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"401ce85bab4a6e8c806619c1a347bd84c244622644eeb62e00630d493f6c85bb","last_reissued_at":"2026-05-18T02:40:54.411694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:54.411694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A De Bruijn-Erdos theorem for 1-2 metric spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vasek Chvatal","submitted_at":"2012-05-06T01:32:07Z","abstract_excerpt":"A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in metric spaces with appropriately defined lines. We prove this generalization in all metric spaces where each nonzero distance equals 1 or 2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1170","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.1170","created_at":"2026-05-18T02:40:54.411752+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1170v1","created_at":"2026-05-18T02:40:54.411752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1170","created_at":"2026-05-18T02:40:54.411752+00:00"},{"alias_kind":"pith_short_12","alias_value":"IAOOQW5LJJXI","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IAOOQW5LJJXIZADG","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IAOOQW5L","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IAOOQW5LJJXIZADGDHA2GR55QT","json":"https://pith.science/pith/IAOOQW5LJJXIZADGDHA2GR55QT.json","graph_json":"https://pith.science/api/pith-number/IAOOQW5LJJXIZADGDHA2GR55QT/graph.json","events_json":"https://pith.science/api/pith-number/IAOOQW5LJJXIZADGDHA2GR55QT/events.json","paper":"https://pith.science/paper/IAOOQW5L"},"agent_actions":{"view_html":"https://pith.science/pith/IAOOQW5LJJXIZADGDHA2GR55QT","download_json":"https://pith.science/pith/IAOOQW5LJJXIZADGDHA2GR55QT.json","view_paper":"https://pith.science/paper/IAOOQW5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1170&json=true","fetch_graph":"https://pith.science/api/pith-number/IAOOQW5LJJXIZADGDHA2GR55QT/graph.json","fetch_events":"https://pith.science/api/pith-number/IAOOQW5LJJXIZADGDHA2GR55QT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IAOOQW5LJJXIZADGDHA2GR55QT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IAOOQW5LJJXIZADGDHA2GR55QT/action/storage_attestation","attest_author":"https://pith.science/pith/IAOOQW5LJJXIZADGDHA2GR55QT/action/author_attestation","sign_citation":"https://pith.science/pith/IAOOQW5LJJXIZADGDHA2GR55QT/action/citation_signature","submit_replication":"https://pith.science/pith/IAOOQW5LJJXIZADGDHA2GR55QT/action/replication_record"}},"created_at":"2026-05-18T02:40:54.411752+00:00","updated_at":"2026-05-18T02:40:54.411752+00:00"}