{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C7DY23CSZ3HQWOSOGUHFUN7M73","short_pith_number":"pith:C7DY23CS","schema_version":"1.0","canonical_sha256":"17c78d6c52cecf0b3a4e350e5a37ecfef07b56d3ad39743dfc8c784c5ae386a8","source":{"kind":"arxiv","id":"1703.09767","version":4},"attestation_state":"computed","paper":{"title":"A Note on the Minimum Number of Edges in Hypergraphs with Property O","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ander Lamaison, Christopher Kusch, Gal Kronenberg, Piotr Micek, Tuan Tran","submitted_at":"2017-03-28T19:42:57Z","abstract_excerpt":"An oriented $k$-uniform hypergraph is said to have Property O if for every linear order of the vertex set, there is some edge oriented consistently with the linear order. Recently Duffus, Kay and R\\\"{o}dl investigated the minimum number $f(k)$ of edges in a $k$-uniform hypergaph with Property O. They proved that $k! \\leq f(k) \\leq (k^2 \\ln k) k!$, where the upper bound holds for $k$ sufficiently large. In this short note we improve their upper bound by a factor of $k \\ln k$, showing that $f(k) \\le \\left(\\lfloor \\frac{k}{2} \\rfloor +1 \\right) k! - \\lfloor \\frac{k}{2} \\rfloor (k-1)!$ for every $"},"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":"1703.09767","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-28T19:42:57Z","cross_cats_sorted":[],"title_canon_sha256":"96646da3bfdf29abbf01a675a392c1f24aba97dff8df098513b15b0f9a37b800","abstract_canon_sha256":"bbbc08589cb4cec56fd62c9d2240cceb1c5bca4f0c07a6c1a354eec8e5cb4af7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:00.232770Z","signature_b64":"RkOhCvlTozwlg8AaIGXaX7WSMUZvpAkih1agfkA5n42rh1b53RDlIWDyxpNIn9q3RvfyDpqEXF5lmP7/OVBuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17c78d6c52cecf0b3a4e350e5a37ecfef07b56d3ad39743dfc8c784c5ae386a8","last_reissued_at":"2026-05-17T23:45:00.232112Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:00.232112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on the Minimum Number of Edges in Hypergraphs with Property O","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ander Lamaison, Christopher Kusch, Gal Kronenberg, Piotr Micek, Tuan Tran","submitted_at":"2017-03-28T19:42:57Z","abstract_excerpt":"An oriented $k$-uniform hypergraph is said to have Property O if for every linear order of the vertex set, there is some edge oriented consistently with the linear order. Recently Duffus, Kay and R\\\"{o}dl investigated the minimum number $f(k)$ of edges in a $k$-uniform hypergaph with Property O. They proved that $k! \\leq f(k) \\leq (k^2 \\ln k) k!$, where the upper bound holds for $k$ sufficiently large. In this short note we improve their upper bound by a factor of $k \\ln k$, showing that $f(k) \\le \\left(\\lfloor \\frac{k}{2} \\rfloor +1 \\right) k! - \\lfloor \\frac{k}{2} \\rfloor (k-1)!$ for every $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09767","kind":"arxiv","version":4},"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":"1703.09767","created_at":"2026-05-17T23:45:00.232206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.09767v4","created_at":"2026-05-17T23:45:00.232206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09767","created_at":"2026-05-17T23:45:00.232206+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7DY23CSZ3HQ","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7DY23CSZ3HQWOSO","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7DY23CS","created_at":"2026-05-18T12:31:10.602751+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/C7DY23CSZ3HQWOSOGUHFUN7M73","json":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73.json","graph_json":"https://pith.science/api/pith-number/C7DY23CSZ3HQWOSOGUHFUN7M73/graph.json","events_json":"https://pith.science/api/pith-number/C7DY23CSZ3HQWOSOGUHFUN7M73/events.json","paper":"https://pith.science/paper/C7DY23CS"},"agent_actions":{"view_html":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73","download_json":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73.json","view_paper":"https://pith.science/paper/C7DY23CS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.09767&json=true","fetch_graph":"https://pith.science/api/pith-number/C7DY23CSZ3HQWOSOGUHFUN7M73/graph.json","fetch_events":"https://pith.science/api/pith-number/C7DY23CSZ3HQWOSOGUHFUN7M73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73/action/storage_attestation","attest_author":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73/action/author_attestation","sign_citation":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73/action/citation_signature","submit_replication":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73/action/replication_record"}},"created_at":"2026-05-17T23:45:00.232206+00:00","updated_at":"2026-05-17T23:45:00.232206+00:00"}