{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G3436RYTDXRVGNTK3BU2Z3W4W5","short_pith_number":"pith:G3436RYT","schema_version":"1.0","canonical_sha256":"36f9bf47131de353366ad869aceedcb7564ae0abe3b3b83d982ed21995a54b39","source":{"kind":"arxiv","id":"2509.08692","version":2},"attestation_state":"computed","paper":{"title":"Property O and Erd\\H{o}s--Szekeres properties in linear hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ander Lamaison, Minghui Ouyang, Suyun Jiang","submitted_at":"2025-09-10T15:33:22Z","abstract_excerpt":"An oriented $k$-uniform hypergraph, or oriented $k$-graph, is said to satisfy Property O if, for every linear ordering of its vertex set, there is some edge oriented consistently with this order. The minimum number $f(k)$ of edges in a $k$-graph with Property O was first studied by Duffus, Kay, and R\\\"{o}dl, and later improved by Kronenberg, Kusch, Lamaison, Micek, and Tran. In particular, they established the bounds $k! + 1 \\le f(k) \\le \\left(\\lfloor\\tfrac{k}{2}\\rfloor+1 \\right) k! - \\lfloor\\tfrac{k}{2}\\rfloor(k-1)!$ for every $k \\ge 2$.\n  In this note, we extend the study of Property O to th"},"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":"2509.08692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T15:33:22Z","cross_cats_sorted":[],"title_canon_sha256":"36181089cc520a89c11c31fd6ff080d5844ba2a153539b8ca3f019659a8a9ea2","abstract_canon_sha256":"f03e6627c11a04d648188786656ad61654c933d8f0d3f5bc990716b49b0609a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:25.152213Z","signature_b64":"mVAVQmtbQjj503ebOqtVtLtawxbR4Zlz1s8Vw87L7th0DzLrCVGO1LZP886QH0c6VrJypczqRwxTKsl6AffpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36f9bf47131de353366ad869aceedcb7564ae0abe3b3b83d982ed21995a54b39","last_reissued_at":"2026-07-05T12:09:25.151746Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:25.151746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Property O and Erd\\H{o}s--Szekeres properties in linear hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ander Lamaison, Minghui Ouyang, Suyun Jiang","submitted_at":"2025-09-10T15:33:22Z","abstract_excerpt":"An oriented $k$-uniform hypergraph, or oriented $k$-graph, is said to satisfy Property O if, for every linear ordering of its vertex set, there is some edge oriented consistently with this order. The minimum number $f(k)$ of edges in a $k$-graph with Property O was first studied by Duffus, Kay, and R\\\"{o}dl, and later improved by Kronenberg, Kusch, Lamaison, Micek, and Tran. In particular, they established the bounds $k! + 1 \\le f(k) \\le \\left(\\lfloor\\tfrac{k}{2}\\rfloor+1 \\right) k! - \\lfloor\\tfrac{k}{2}\\rfloor(k-1)!$ for every $k \\ge 2$.\n  In this note, we extend the study of Property O to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08692","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.08692/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2509.08692","created_at":"2026-07-05T12:09:25.151801+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08692v2","created_at":"2026-07-05T12:09:25.151801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08692","created_at":"2026-07-05T12:09:25.151801+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3436RYTDXRV","created_at":"2026-07-05T12:09:25.151801+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3436RYTDXRVGNTK","created_at":"2026-07-05T12:09:25.151801+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3436RYT","created_at":"2026-07-05T12:09:25.151801+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/G3436RYTDXRVGNTK3BU2Z3W4W5","json":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5.json","graph_json":"https://pith.science/api/pith-number/G3436RYTDXRVGNTK3BU2Z3W4W5/graph.json","events_json":"https://pith.science/api/pith-number/G3436RYTDXRVGNTK3BU2Z3W4W5/events.json","paper":"https://pith.science/paper/G3436RYT"},"agent_actions":{"view_html":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5","download_json":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5.json","view_paper":"https://pith.science/paper/G3436RYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08692&json=true","fetch_graph":"https://pith.science/api/pith-number/G3436RYTDXRVGNTK3BU2Z3W4W5/graph.json","fetch_events":"https://pith.science/api/pith-number/G3436RYTDXRVGNTK3BU2Z3W4W5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5/action/storage_attestation","attest_author":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5/action/author_attestation","sign_citation":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5/action/citation_signature","submit_replication":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5/action/replication_record"}},"created_at":"2026-07-05T12:09:25.151801+00:00","updated_at":"2026-07-05T12:09:25.151801+00:00"}