{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZZ7GCAI43ROBBZP23TCBCJ7GIY","short_pith_number":"pith:ZZ7GCAI4","canonical_record":{"source":{"id":"1509.03268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T18:48:28Z","cross_cats_sorted":[],"title_canon_sha256":"684da86fa5c01a38eb01d926529d81cb6f9f457bb902ed050642774259b46ce1","abstract_canon_sha256":"eb0f0bd170ac602b68c76d7810888202da8da2aca7da8c08e37bea246ecefe2b"},"schema_version":"1.0"},"canonical_sha256":"ce7e61011cdc5c10e5fadcc41127e646290d0a77cbf457e195e26d2d8ba1025d","source":{"kind":"arxiv","id":"1509.03268","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03268","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03268v2","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03268","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ7GCAI43ROB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ7GCAI43ROBBZP2","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ7GCAI4","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZZ7GCAI43ROBBZP23TCBCJ7GIY","target":"record","payload":{"canonical_record":{"source":{"id":"1509.03268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T18:48:28Z","cross_cats_sorted":[],"title_canon_sha256":"684da86fa5c01a38eb01d926529d81cb6f9f457bb902ed050642774259b46ce1","abstract_canon_sha256":"eb0f0bd170ac602b68c76d7810888202da8da2aca7da8c08e37bea246ecefe2b"},"schema_version":"1.0"},"canonical_sha256":"ce7e61011cdc5c10e5fadcc41127e646290d0a77cbf457e195e26d2d8ba1025d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:10.102277Z","signature_b64":"ODuqk888r3SV6mqDBHoG/SbBDU9qRpNa++XiOvy0snj4e51QrzYcFBb+vp0omHbw/2hi+MelhrnaagrVO7uMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce7e61011cdc5c10e5fadcc41127e646290d0a77cbf457e195e26d2d8ba1025d","last_reissued_at":"2026-05-18T01:00:10.101779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:10.101779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.03268","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-05-18T01:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jszXEQEm9u1zo7GIzVAU/u2aKrH2cALGdEyjRo5uv7PhF3Yp0IBCXPAEGWJcyV7vV2FO74JbnQ5QIPeR2uJDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:48:49.195869Z"},"content_sha256":"ed3ae44d6992501040d469867f1f6784063d63479a8dc77cf0d7e44c88dbb133","schema_version":"1.0","event_id":"sha256:ed3ae44d6992501040d469867f1f6784063d63479a8dc77cf0d7e44c88dbb133"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZZ7GCAI43ROBBZP23TCBCJ7GIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tournaments, 4-uniform hypergraphs, and an exact extremal result","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jason Semeraro, Karen Gunderson","submitted_at":"2015-09-10T18:48:28Z","abstract_excerpt":"We consider $4$-uniform hypergraphs with the maximum number of hyperedges subject to the condition that every set of $5$ vertices spans either $0$ or exactly $2$ hyperedges and give a construction, using quadratic residues, for an infinite family of such hypergraphs with the maximum number of hyperedges. Baber has previously given an asymptotically best-possible result using random tournaments. We give a connection between Baber's result and our construction via Paley tournaments and investigate a `switching' operation on tournaments that preserves hypergraphs arising from this construction."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03268","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":""},"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:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ICmXWVcIyCNAdOL0DbXhN6CED53GzWG39ka2XQ7vOZmT1JFQvxrL+MDFxZxi86uSjVQdtcj8UFhN8tR/uI6fAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:48:49.196533Z"},"content_sha256":"464a8e6eb04c8525c084878bae0c894e3273deef5df5baa365abdd84e02be18d","schema_version":"1.0","event_id":"sha256:464a8e6eb04c8525c084878bae0c894e3273deef5df5baa365abdd84e02be18d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZ7GCAI43ROBBZP23TCBCJ7GIY/bundle.json","state_url":"https://pith.science/pith/ZZ7GCAI43ROBBZP23TCBCJ7GIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZ7GCAI43ROBBZP23TCBCJ7GIY/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-05-29T14:48:49Z","links":{"resolver":"https://pith.science/pith/ZZ7GCAI43ROBBZP23TCBCJ7GIY","bundle":"https://pith.science/pith/ZZ7GCAI43ROBBZP23TCBCJ7GIY/bundle.json","state":"https://pith.science/pith/ZZ7GCAI43ROBBZP23TCBCJ7GIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZ7GCAI43ROBBZP23TCBCJ7GIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZZ7GCAI43ROBBZP23TCBCJ7GIY","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":"eb0f0bd170ac602b68c76d7810888202da8da2aca7da8c08e37bea246ecefe2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T18:48:28Z","title_canon_sha256":"684da86fa5c01a38eb01d926529d81cb6f9f457bb902ed050642774259b46ce1"},"schema_version":"1.0","source":{"id":"1509.03268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03268","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03268v2","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03268","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ7GCAI43ROB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ7GCAI43ROBBZP2","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ7GCAI4","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:464a8e6eb04c8525c084878bae0c894e3273deef5df5baa365abdd84e02be18d","target":"graph","created_at":"2026-05-18T01:00:10Z","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":"We consider $4$-uniform hypergraphs with the maximum number of hyperedges subject to the condition that every set of $5$ vertices spans either $0$ or exactly $2$ hyperedges and give a construction, using quadratic residues, for an infinite family of such hypergraphs with the maximum number of hyperedges. Baber has previously given an asymptotically best-possible result using random tournaments. We give a connection between Baber's result and our construction via Paley tournaments and investigate a `switching' operation on tournaments that preserves hypergraphs arising from this construction.","authors_text":"Jason Semeraro, Karen Gunderson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T18:48:28Z","title":"Tournaments, 4-uniform hypergraphs, and an exact extremal result"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03268","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:ed3ae44d6992501040d469867f1f6784063d63479a8dc77cf0d7e44c88dbb133","target":"record","created_at":"2026-05-18T01:00:10Z","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":"eb0f0bd170ac602b68c76d7810888202da8da2aca7da8c08e37bea246ecefe2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T18:48:28Z","title_canon_sha256":"684da86fa5c01a38eb01d926529d81cb6f9f457bb902ed050642774259b46ce1"},"schema_version":"1.0","source":{"id":"1509.03268","kind":"arxiv","version":2}},"canonical_sha256":"ce7e61011cdc5c10e5fadcc41127e646290d0a77cbf457e195e26d2d8ba1025d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce7e61011cdc5c10e5fadcc41127e646290d0a77cbf457e195e26d2d8ba1025d","first_computed_at":"2026-05-18T01:00:10.101779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:10.101779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ODuqk888r3SV6mqDBHoG/SbBDU9qRpNa++XiOvy0snj4e51QrzYcFBb+vp0omHbw/2hi+MelhrnaagrVO7uMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:10.102277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed3ae44d6992501040d469867f1f6784063d63479a8dc77cf0d7e44c88dbb133","sha256:464a8e6eb04c8525c084878bae0c894e3273deef5df5baa365abdd84e02be18d"],"state_sha256":"e3f6bb0c495b063fb4cf8c637b5c4baa533400a9f4ad2c0aaba55fa426e1d8cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jx/Dd3mnZr4zDIPomRh+3NqMVygIio+6Su433aRabSywv1fcVYPrXYuIeonHM/zJBQBpKqeSImV7rPuqlh0WAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:48:49.200046Z","bundle_sha256":"bf2b8053883e912de3e7049c39a16d0dd8f9054093b49543411a38121173052f"}}