{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RTAAQHLKQHASYKG2LCKM6ZAG6W","short_pith_number":"pith:RTAAQHLK","canonical_record":{"source":{"id":"1608.06621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-23T19:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"73a2eb51351946fd57391f135ddb7d87a1648f1fd09e450f9330a4a4895a35c5","abstract_canon_sha256":"44378f05e61c98068838d423cb87ed27309367cfda206b4a339b8858ea7048d6"},"schema_version":"1.0"},"canonical_sha256":"8cc0081d6a81c12c28da5894cf6406f58103147ce15c2bb4ec3e66282808782d","source":{"kind":"arxiv","id":"1608.06621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06621","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06621v1","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06621","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"RTAAQHLKQHAS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RTAAQHLKQHASYKG2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RTAAQHLK","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RTAAQHLKQHASYKG2LCKM6ZAG6W","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-23T19:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"73a2eb51351946fd57391f135ddb7d87a1648f1fd09e450f9330a4a4895a35c5","abstract_canon_sha256":"44378f05e61c98068838d423cb87ed27309367cfda206b4a339b8858ea7048d6"},"schema_version":"1.0"},"canonical_sha256":"8cc0081d6a81c12c28da5894cf6406f58103147ce15c2bb4ec3e66282808782d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:13.634091Z","signature_b64":"uB2oMfayJhEbSD5Gh8APGynKOTPYepYFOxhQn57Tz4G9ivwezRBzZJqoEtMtJFqc1O9VAsVXvmA3JyxVM1HNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cc0081d6a81c12c28da5894cf6406f58103147ce15c2bb4ec3e66282808782d","last_reissued_at":"2026-05-18T01:08:13.633295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:13.633295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06621","source_version":1,"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-18T01:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6fNZ9RvAU3/TMwXPrESRDEB9q7I34KA4XItMTbUpyFrgCsSQKP3qo7G9BAAxRcsiS1G+2XR8qmoDSdpliObDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:48:14.515955Z"},"content_sha256":"0fc7affc1fa1d048cbf1d1842b6d34eaa1eb67b3d5dcaf45e81353d9fb997cd2","schema_version":"1.0","event_id":"sha256:0fc7affc1fa1d048cbf1d1842b6d34eaa1eb67b3d5dcaf45e81353d9fb997cd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RTAAQHLKQHASYKG2LCKM6ZAG6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Minimum Number of Edges in Uniform Hypergraphs with Property O","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bill Kay, Dwight Duffus, Vojtech Rodl","submitted_at":"2016-08-23T19:52:00Z","abstract_excerpt":"An oriented k-uniform hypergraph (a family of ordered k-sets) has the ordering property (or Property O) if for every linear order of the vertex set, there is some edge oriented consistently with the linear order. We find bounds on the minimum number of edges in a hypergraph with Property O."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06621","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"},"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-18T01:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CmdjjDawhCPDmHzQ41JLNkI1DsaRPfMyhpwt8iTWOdgkzL05aIFf2Ocf3aLn4GURGO2pqbIAd3/CX+c05IaeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:48:14.516669Z"},"content_sha256":"be949a8fb312f894fc24991b2bcbc85aaa239bbe0a459e91c1bd6903581f520f","schema_version":"1.0","event_id":"sha256:be949a8fb312f894fc24991b2bcbc85aaa239bbe0a459e91c1bd6903581f520f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTAAQHLKQHASYKG2LCKM6ZAG6W/bundle.json","state_url":"https://pith.science/pith/RTAAQHLKQHASYKG2LCKM6ZAG6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTAAQHLKQHASYKG2LCKM6ZAG6W/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-09T03:48:14Z","links":{"resolver":"https://pith.science/pith/RTAAQHLKQHASYKG2LCKM6ZAG6W","bundle":"https://pith.science/pith/RTAAQHLKQHASYKG2LCKM6ZAG6W/bundle.json","state":"https://pith.science/pith/RTAAQHLKQHASYKG2LCKM6ZAG6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTAAQHLKQHASYKG2LCKM6ZAG6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RTAAQHLKQHASYKG2LCKM6ZAG6W","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":"44378f05e61c98068838d423cb87ed27309367cfda206b4a339b8858ea7048d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-23T19:52:00Z","title_canon_sha256":"73a2eb51351946fd57391f135ddb7d87a1648f1fd09e450f9330a4a4895a35c5"},"schema_version":"1.0","source":{"id":"1608.06621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06621","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06621v1","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06621","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"RTAAQHLKQHAS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RTAAQHLKQHASYKG2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RTAAQHLK","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:be949a8fb312f894fc24991b2bcbc85aaa239bbe0a459e91c1bd6903581f520f","target":"graph","created_at":"2026-05-18T01:08:13Z","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 (a family of ordered k-sets) has the ordering property (or Property O) if for every linear order of the vertex set, there is some edge oriented consistently with the linear order. We find bounds on the minimum number of edges in a hypergraph with Property O.","authors_text":"Bill Kay, Dwight Duffus, Vojtech Rodl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-23T19:52:00Z","title":"The Minimum Number of Edges in Uniform Hypergraphs with Property O"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06621","kind":"arxiv","version":1},"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:0fc7affc1fa1d048cbf1d1842b6d34eaa1eb67b3d5dcaf45e81353d9fb997cd2","target":"record","created_at":"2026-05-18T01:08:13Z","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":"44378f05e61c98068838d423cb87ed27309367cfda206b4a339b8858ea7048d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-23T19:52:00Z","title_canon_sha256":"73a2eb51351946fd57391f135ddb7d87a1648f1fd09e450f9330a4a4895a35c5"},"schema_version":"1.0","source":{"id":"1608.06621","kind":"arxiv","version":1}},"canonical_sha256":"8cc0081d6a81c12c28da5894cf6406f58103147ce15c2bb4ec3e66282808782d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cc0081d6a81c12c28da5894cf6406f58103147ce15c2bb4ec3e66282808782d","first_computed_at":"2026-05-18T01:08:13.633295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:13.633295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uB2oMfayJhEbSD5Gh8APGynKOTPYepYFOxhQn57Tz4G9ivwezRBzZJqoEtMtJFqc1O9VAsVXvmA3JyxVM1HNDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:13.634091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fc7affc1fa1d048cbf1d1842b6d34eaa1eb67b3d5dcaf45e81353d9fb997cd2","sha256:be949a8fb312f894fc24991b2bcbc85aaa239bbe0a459e91c1bd6903581f520f"],"state_sha256":"0726905bb497280f0df87d09f70bc43bf57b4ea3fe119d2d846aa37778af7a48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5joHskNEdAXdiMdfhBVIpuTsw6ZEilmKFX2EFLM32Gt5QDrdmHc2Z9xUjWDLZkF+X4rR0p6GmG6FjXbpVsFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:48:14.522459Z","bundle_sha256":"0d51d7c9ec88006c918f1e4fc64e9e1eda1f96f894b9d4c72cd0aef36b61569e"}}