{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C7DY23CSZ3HQWOSOGUHFUN7M73","short_pith_number":"pith:C7DY23CS","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"},"canonical_sha256":"17c78d6c52cecf0b3a4e350e5a37ecfef07b56d3ad39743dfc8c784c5ae386a8","source":{"kind":"arxiv","id":"1703.09767","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09767","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09767v4","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09767","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"C7DY23CSZ3HQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"C7DY23CSZ3HQWOSO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"C7DY23CS","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C7DY23CSZ3HQWOSOGUHFUN7M73","target":"record","payload":{"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"},"canonical_sha256":"17c78d6c52cecf0b3a4e350e5a37ecfef07b56d3ad39743dfc8c784c5ae386a8","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"},"source_kind":"arxiv","source_id":"1703.09767","source_version":4,"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-17T23:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+rMczsI7oDZw4puZ9MoCFmWH7X4jQHtm25rlC+x2qB3czvwxOWUq14mnnWe1m+EFMLRqYz3XoRPRFt4P8x0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:37:59.933714Z"},"content_sha256":"925fdd7c6607e3d647bd122593e2c06cd2a1f423acbefeabdd67c8d8fc538d0f","schema_version":"1.0","event_id":"sha256:925fdd7c6607e3d647bd122593e2c06cd2a1f423acbefeabdd67c8d8fc538d0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C7DY23CSZ3HQWOSOGUHFUN7M73","target":"graph","payload":{"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"},"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-17T23:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owllt+L8lpnrYNUc7B0c4RPsnIWVNbHGbD+nYGZTcvarl+a5FOrmSK2n4jZKgPp0p35OGEYva/LPZveWAPfPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:37:59.934344Z"},"content_sha256":"6281f00c68a443420e5e65bb5717c867e34b156108f3197945678c4179ef9ed6","schema_version":"1.0","event_id":"sha256:6281f00c68a443420e5e65bb5717c867e34b156108f3197945678c4179ef9ed6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73/bundle.json","state_url":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7DY23CSZ3HQWOSOGUHFUN7M73/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-06-01T03:37:59Z","links":{"resolver":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73","bundle":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73/bundle.json","state":"https://pith.science/pith/C7DY23CSZ3HQWOSOGUHFUN7M73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7DY23CSZ3HQWOSOGUHFUN7M73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C7DY23CSZ3HQWOSOGUHFUN7M73","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":"bbbc08589cb4cec56fd62c9d2240cceb1c5bca4f0c07a6c1a354eec8e5cb4af7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-28T19:42:57Z","title_canon_sha256":"96646da3bfdf29abbf01a675a392c1f24aba97dff8df098513b15b0f9a37b800"},"schema_version":"1.0","source":{"id":"1703.09767","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09767","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09767v4","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09767","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"C7DY23CSZ3HQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"C7DY23CSZ3HQWOSO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"C7DY23CS","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:6281f00c68a443420e5e65bb5717c867e34b156108f3197945678c4179ef9ed6","target":"graph","created_at":"2026-05-17T23:45:00Z","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":"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 $","authors_text":"Ander Lamaison, Christopher Kusch, Gal Kronenberg, Piotr Micek, Tuan Tran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-28T19:42:57Z","title":"A Note on the Minimum Number of Edges in Hypergraphs with Property O"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09767","kind":"arxiv","version":4},"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:925fdd7c6607e3d647bd122593e2c06cd2a1f423acbefeabdd67c8d8fc538d0f","target":"record","created_at":"2026-05-17T23:45:00Z","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":"bbbc08589cb4cec56fd62c9d2240cceb1c5bca4f0c07a6c1a354eec8e5cb4af7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-28T19:42:57Z","title_canon_sha256":"96646da3bfdf29abbf01a675a392c1f24aba97dff8df098513b15b0f9a37b800"},"schema_version":"1.0","source":{"id":"1703.09767","kind":"arxiv","version":4}},"canonical_sha256":"17c78d6c52cecf0b3a4e350e5a37ecfef07b56d3ad39743dfc8c784c5ae386a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17c78d6c52cecf0b3a4e350e5a37ecfef07b56d3ad39743dfc8c784c5ae386a8","first_computed_at":"2026-05-17T23:45:00.232112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:00.232112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RkOhCvlTozwlg8AaIGXaX7WSMUZvpAkih1agfkA5n42rh1b53RDlIWDyxpNIn9q3RvfyDpqEXF5lmP7/OVBuAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:00.232770Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09767","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:925fdd7c6607e3d647bd122593e2c06cd2a1f423acbefeabdd67c8d8fc538d0f","sha256:6281f00c68a443420e5e65bb5717c867e34b156108f3197945678c4179ef9ed6"],"state_sha256":"af8417422bfa3be362cdb4718002febb76df2d689600343d49d4942d60e037d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ceJSMH5caB9X0HgPuRtOkWfO4ASjzzBmfVvIGXJYMIDJ91R8qo4UCAy+O/0qLTpa8GTWGiLR30Rvt+j8SbLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:37:59.937729Z","bundle_sha256":"c7bd95edf0978af8b344dd85eaee7b7fc8cc95b484af72fd8f58daf3f07927a6"}}