{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:G3436RYTDXRVGNTK3BU2Z3W4W5","short_pith_number":"pith:G3436RYT","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"},"canonical_sha256":"36f9bf47131de353366ad869aceedcb7564ae0abe3b3b83d982ed21995a54b39","source":{"kind":"arxiv","id":"2509.08692","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08692","created_at":"2026-07-05T12:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08692v2","created_at":"2026-07-05T12:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08692","created_at":"2026-07-05T12:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"G3436RYTDXRV","created_at":"2026-07-05T12:09:25Z"},{"alias_kind":"pith_short_16","alias_value":"G3436RYTDXRVGNTK","created_at":"2026-07-05T12:09:25Z"},{"alias_kind":"pith_short_8","alias_value":"G3436RYT","created_at":"2026-07-05T12:09:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:G3436RYTDXRVGNTK3BU2Z3W4W5","target":"record","payload":{"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"},"canonical_sha256":"36f9bf47131de353366ad869aceedcb7564ae0abe3b3b83d982ed21995a54b39","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"},"source_kind":"arxiv","source_id":"2509.08692","source_version":2,"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-07-05T12:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTHcbjlSup4NeosmEaUq1O+rkZacpZcdKoYZKtJV9lnOPg6hM/UXykVkuMfVBAHK72eoepCBaBrxsO7AR8KMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:00:02.790310Z"},"content_sha256":"c0fe4c935d308e2f1a0e0549d27b9029d8f116eff5d8065e83d5f563cb19879f","schema_version":"1.0","event_id":"sha256:c0fe4c935d308e2f1a0e0549d27b9029d8f116eff5d8065e83d5f563cb19879f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:G3436RYTDXRVGNTK3BU2Z3W4W5","target":"graph","payload":{"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"},"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-07-05T12:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wryg0kiBzC9ZOprgfK6JohKnT3CF/Ka1pgvKl5obCuDAbZeI1wFWdObnLYWEU3BNRHurwZ48ylMbBfdHigkdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:00:02.790826Z"},"content_sha256":"faf2475b86670ada9164b33bffacf4bddb68a11120ad8162f165434580bedd0e","schema_version":"1.0","event_id":"sha256:faf2475b86670ada9164b33bffacf4bddb68a11120ad8162f165434580bedd0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5/bundle.json","state_url":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3436RYTDXRVGNTK3BU2Z3W4W5/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-08-19T08:00:02Z","links":{"resolver":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5","bundle":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5/bundle.json","state":"https://pith.science/pith/G3436RYTDXRVGNTK3BU2Z3W4W5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3436RYTDXRVGNTK3BU2Z3W4W5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:G3436RYTDXRVGNTK3BU2Z3W4W5","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":"f03e6627c11a04d648188786656ad61654c933d8f0d3f5bc990716b49b0609a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T15:33:22Z","title_canon_sha256":"36181089cc520a89c11c31fd6ff080d5844ba2a153539b8ca3f019659a8a9ea2"},"schema_version":"1.0","source":{"id":"2509.08692","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08692","created_at":"2026-07-05T12:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08692v2","created_at":"2026-07-05T12:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08692","created_at":"2026-07-05T12:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"G3436RYTDXRV","created_at":"2026-07-05T12:09:25Z"},{"alias_kind":"pith_short_16","alias_value":"G3436RYTDXRVGNTK","created_at":"2026-07-05T12:09:25Z"},{"alias_kind":"pith_short_8","alias_value":"G3436RYT","created_at":"2026-07-05T12:09:25Z"}],"graph_snapshots":[{"event_id":"sha256:faf2475b86670ada9164b33bffacf4bddb68a11120ad8162f165434580bedd0e","target":"graph","created_at":"2026-07-05T12:09:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.08692/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ander Lamaison, Minghui Ouyang, Suyun Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T15:33:22Z","title":"Property O and Erd\\H{o}s--Szekeres properties in linear hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08692","kind":"arxiv","version":2},"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:c0fe4c935d308e2f1a0e0549d27b9029d8f116eff5d8065e83d5f563cb19879f","target":"record","created_at":"2026-07-05T12:09:25Z","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":"f03e6627c11a04d648188786656ad61654c933d8f0d3f5bc990716b49b0609a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T15:33:22Z","title_canon_sha256":"36181089cc520a89c11c31fd6ff080d5844ba2a153539b8ca3f019659a8a9ea2"},"schema_version":"1.0","source":{"id":"2509.08692","kind":"arxiv","version":2}},"canonical_sha256":"36f9bf47131de353366ad869aceedcb7564ae0abe3b3b83d982ed21995a54b39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36f9bf47131de353366ad869aceedcb7564ae0abe3b3b83d982ed21995a54b39","first_computed_at":"2026-07-05T12:09:25.151746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:09:25.151746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mVAVQmtbQjj503ebOqtVtLtawxbR4Zlz1s8Vw87L7th0DzLrCVGO1LZP886QH0c6VrJypczqRwxTKsl6AffpBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:09:25.152213Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.08692","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0fe4c935d308e2f1a0e0549d27b9029d8f116eff5d8065e83d5f563cb19879f","sha256:faf2475b86670ada9164b33bffacf4bddb68a11120ad8162f165434580bedd0e"],"state_sha256":"409ab89ce7fcbe234da113105aad6626576baa5ffffa14acd391d0f30b0915bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSPKdg/1U28Gtq8BhGSyVr37CjwaeQUR8l3o2PdeJWu5/N1+Rgm77YDStKXmaQyzz494W+6g6GFOq2BIn7krCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T08:00:02.795745Z","bundle_sha256":"f649672a1f130cdbe9cd923074982fc2d19e1a9a221e8ba4833170dbe8c7ecb4"}}