{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2HKD35DGUTVDU2LITEEVTGGK4Y","short_pith_number":"pith:2HKD35DG","schema_version":"1.0","canonical_sha256":"d1d43df466a4ea3a696899095998cae626738aa7ba1f188056437e0b4d7fb129","source":{"kind":"arxiv","id":"1807.04826","version":1},"attestation_state":"computed","paper":{"title":"The geometry and combinatorics of discrete line segment hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher O'Neill, Deborah Oliveros, Shira Zerbib","submitted_at":"2018-07-12T21:20:11Z","abstract_excerpt":"An $r$-segment hypergraph $H$ is a hypergraph whose edges consist of $r$ consecutive integer points on line segments in $\\mathbb{R}^2$. In this paper, we bound the chromatic number $\\chi(H)$ and covering number $\\tau(H)$ of hypergraphs in this family, uncovering several interesting geometric properties in the process. We conjecture that for $r \\ge 3$, the covering number $\\tau(H)$ is at most $(r - 1)\\nu(H)$, where $\\nu(H)$ denotes the matching number of $H$. We prove our conjecture in the case where $\\nu(H) = 1$, and provide improved (in fact, optimal) bounds on $\\tau(H)$ for $r \\le 5$. We als"},"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":"1807.04826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-12T21:20:11Z","cross_cats_sorted":[],"title_canon_sha256":"ce680b1ae2a5eacf094c9ac4ff89f90c7c06465373fa6136182a4c0f680009af","abstract_canon_sha256":"063b8f69161214069db26d99ae1a5f95357da579e8e41bc72582063367150d10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:49.712992Z","signature_b64":"2riIp07R0NJlcVY4M8ezVuZhLC4Q7JLVvSeCN0ztGMpBN6vNHlg8g5WS0cc6ALAq5/f4zLJPJqgITwlJbe4RAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1d43df466a4ea3a696899095998cae626738aa7ba1f188056437e0b4d7fb129","last_reissued_at":"2026-05-18T00:10:49.712548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:49.712548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The geometry and combinatorics of discrete line segment hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher O'Neill, Deborah Oliveros, Shira Zerbib","submitted_at":"2018-07-12T21:20:11Z","abstract_excerpt":"An $r$-segment hypergraph $H$ is a hypergraph whose edges consist of $r$ consecutive integer points on line segments in $\\mathbb{R}^2$. In this paper, we bound the chromatic number $\\chi(H)$ and covering number $\\tau(H)$ of hypergraphs in this family, uncovering several interesting geometric properties in the process. We conjecture that for $r \\ge 3$, the covering number $\\tau(H)$ is at most $(r - 1)\\nu(H)$, where $\\nu(H)$ denotes the matching number of $H$. We prove our conjecture in the case where $\\nu(H) = 1$, and provide improved (in fact, optimal) bounds on $\\tau(H)$ for $r \\le 5$. We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04826","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":"1807.04826","created_at":"2026-05-18T00:10:49.712613+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04826v1","created_at":"2026-05-18T00:10:49.712613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04826","created_at":"2026-05-18T00:10:49.712613+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HKD35DGUTVD","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HKD35DGUTVDU2LI","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HKD35DG","created_at":"2026-05-18T12:32:02.567920+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/2HKD35DGUTVDU2LITEEVTGGK4Y","json":"https://pith.science/pith/2HKD35DGUTVDU2LITEEVTGGK4Y.json","graph_json":"https://pith.science/api/pith-number/2HKD35DGUTVDU2LITEEVTGGK4Y/graph.json","events_json":"https://pith.science/api/pith-number/2HKD35DGUTVDU2LITEEVTGGK4Y/events.json","paper":"https://pith.science/paper/2HKD35DG"},"agent_actions":{"view_html":"https://pith.science/pith/2HKD35DGUTVDU2LITEEVTGGK4Y","download_json":"https://pith.science/pith/2HKD35DGUTVDU2LITEEVTGGK4Y.json","view_paper":"https://pith.science/paper/2HKD35DG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04826&json=true","fetch_graph":"https://pith.science/api/pith-number/2HKD35DGUTVDU2LITEEVTGGK4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/2HKD35DGUTVDU2LITEEVTGGK4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HKD35DGUTVDU2LITEEVTGGK4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HKD35DGUTVDU2LITEEVTGGK4Y/action/storage_attestation","attest_author":"https://pith.science/pith/2HKD35DGUTVDU2LITEEVTGGK4Y/action/author_attestation","sign_citation":"https://pith.science/pith/2HKD35DGUTVDU2LITEEVTGGK4Y/action/citation_signature","submit_replication":"https://pith.science/pith/2HKD35DGUTVDU2LITEEVTGGK4Y/action/replication_record"}},"created_at":"2026-05-18T00:10:49.712613+00:00","updated_at":"2026-05-18T00:10:49.712613+00:00"}