{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5Z3XG3IX46KW3MJWWPEFVCEDBQ","short_pith_number":"pith:5Z3XG3IX","canonical_record":{"source":{"id":"1310.1501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-05T17:56:17Z","cross_cats_sorted":[],"title_canon_sha256":"610c12d29c0f6cc6f1efdf3e843c273b133e5453abb9b9ad0fc06ab9b89d5e4f","abstract_canon_sha256":"a22b96814cbc8616b36a7621cc4d80cd0b0ca59643d1c25f61824eabff932b77"},"schema_version":"1.0"},"canonical_sha256":"ee77736d17e7956db136b3c85a88830c11d6b3b18818138575922cddfecdfe91","source":{"kind":"arxiv","id":"1310.1501","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1501","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1501v2","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1501","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"5Z3XG3IX46KW","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5Z3XG3IX46KW3MJW","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5Z3XG3IX","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5Z3XG3IX46KW3MJWWPEFVCEDBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1310.1501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-05T17:56:17Z","cross_cats_sorted":[],"title_canon_sha256":"610c12d29c0f6cc6f1efdf3e843c273b133e5453abb9b9ad0fc06ab9b89d5e4f","abstract_canon_sha256":"a22b96814cbc8616b36a7621cc4d80cd0b0ca59643d1c25f61824eabff932b77"},"schema_version":"1.0"},"canonical_sha256":"ee77736d17e7956db136b3c85a88830c11d6b3b18818138575922cddfecdfe91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:59.195755Z","signature_b64":"zX6Mea6Dt7/28N8i2ol9xHTFXC3iWDeGPB90ICHTjXxjXCXk8EyC2MjYWkpBgLyKqgiN3ZwM1xco026ghIeVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee77736d17e7956db136b3c85a88830c11d6b3b18818138575922cddfecdfe91","last_reissued_at":"2026-05-18T02:00:59.195271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:59.195271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.1501","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-18T02:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N5LEinIunL1qqm5At7X6ldzAPxF3ValPh8bNP1b4y9h6+1g4a1nf7aZ6TSUtMY7BhUhz/OGb82JQkuXego7dDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:21:59.930240Z"},"content_sha256":"578d5b9329f670715e8ed158f35ab5dc5238849d789907a2726aeb33ed4f89ce","schema_version":"1.0","event_id":"sha256:578d5b9329f670715e8ed158f35ab5dc5238849d789907a2726aeb33ed4f89ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5Z3XG3IX46KW3MJWWPEFVCEDBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mantel's Theorem for Random Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jane Butterfield, John Lenz, J\\'ozsef Balogh, Ping Hu","submitted_at":"2013-10-05T17:56:17Z","abstract_excerpt":"A classical result in extremal graph theory is Mantel's Theorem, which states that every maximum triangle-free subgraph of $K_n$ is bipartite. A sparse version of Mantel's Theorem is that, for sufficiently large $p$, every maximum triangle-free subgraph of $G(n,p)$ is w.h.p. bipartite. Recently, DeMarco and Kahn proved this for $p > K \\sqrt{\\log n/n}$ for some constant $K$, and apart from the value of the constant this bound is best possible. We study an extremal problem of this type in random hypergraphs. Denote by $F_5$, which sometimes called as the generalized triangle, the 3-uniform hyper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1501","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-18T02:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TcETqGfQaZgSs1vefnRreNPYG0jy6yR3vDF4gwlmgrE5JWKCfugW/Uh8UYJpVCI/S9mrEwj2dOxI9VrUq+gKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:21:59.930594Z"},"content_sha256":"02bd654be1c01cd305893c4b8a544b82af3bda56447387ffe41bd8954e202ae0","schema_version":"1.0","event_id":"sha256:02bd654be1c01cd305893c4b8a544b82af3bda56447387ffe41bd8954e202ae0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5Z3XG3IX46KW3MJWWPEFVCEDBQ/bundle.json","state_url":"https://pith.science/pith/5Z3XG3IX46KW3MJWWPEFVCEDBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5Z3XG3IX46KW3MJWWPEFVCEDBQ/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-01T10:21:59Z","links":{"resolver":"https://pith.science/pith/5Z3XG3IX46KW3MJWWPEFVCEDBQ","bundle":"https://pith.science/pith/5Z3XG3IX46KW3MJWWPEFVCEDBQ/bundle.json","state":"https://pith.science/pith/5Z3XG3IX46KW3MJWWPEFVCEDBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5Z3XG3IX46KW3MJWWPEFVCEDBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5Z3XG3IX46KW3MJWWPEFVCEDBQ","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":"a22b96814cbc8616b36a7621cc4d80cd0b0ca59643d1c25f61824eabff932b77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-05T17:56:17Z","title_canon_sha256":"610c12d29c0f6cc6f1efdf3e843c273b133e5453abb9b9ad0fc06ab9b89d5e4f"},"schema_version":"1.0","source":{"id":"1310.1501","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1501","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1501v2","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1501","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"5Z3XG3IX46KW","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5Z3XG3IX46KW3MJW","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5Z3XG3IX","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:02bd654be1c01cd305893c4b8a544b82af3bda56447387ffe41bd8954e202ae0","target":"graph","created_at":"2026-05-18T02:00:59Z","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":"A classical result in extremal graph theory is Mantel's Theorem, which states that every maximum triangle-free subgraph of $K_n$ is bipartite. A sparse version of Mantel's Theorem is that, for sufficiently large $p$, every maximum triangle-free subgraph of $G(n,p)$ is w.h.p. bipartite. Recently, DeMarco and Kahn proved this for $p > K \\sqrt{\\log n/n}$ for some constant $K$, and apart from the value of the constant this bound is best possible. We study an extremal problem of this type in random hypergraphs. Denote by $F_5$, which sometimes called as the generalized triangle, the 3-uniform hyper","authors_text":"Jane Butterfield, John Lenz, J\\'ozsef Balogh, Ping Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-05T17:56:17Z","title":"Mantel's Theorem for Random Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1501","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:578d5b9329f670715e8ed158f35ab5dc5238849d789907a2726aeb33ed4f89ce","target":"record","created_at":"2026-05-18T02:00:59Z","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":"a22b96814cbc8616b36a7621cc4d80cd0b0ca59643d1c25f61824eabff932b77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-05T17:56:17Z","title_canon_sha256":"610c12d29c0f6cc6f1efdf3e843c273b133e5453abb9b9ad0fc06ab9b89d5e4f"},"schema_version":"1.0","source":{"id":"1310.1501","kind":"arxiv","version":2}},"canonical_sha256":"ee77736d17e7956db136b3c85a88830c11d6b3b18818138575922cddfecdfe91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee77736d17e7956db136b3c85a88830c11d6b3b18818138575922cddfecdfe91","first_computed_at":"2026-05-18T02:00:59.195271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:59.195271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zX6Mea6Dt7/28N8i2ol9xHTFXC3iWDeGPB90ICHTjXxjXCXk8EyC2MjYWkpBgLyKqgiN3ZwM1xco026ghIeVCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:59.195755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1501","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:578d5b9329f670715e8ed158f35ab5dc5238849d789907a2726aeb33ed4f89ce","sha256:02bd654be1c01cd305893c4b8a544b82af3bda56447387ffe41bd8954e202ae0"],"state_sha256":"4449ff59969fb24f5a88126cbbcb60878ca3e634355398bb00f1791f05b9f95f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QcwypVZH/fQ+0k98Dt0VA6AFAEJilxyFH5kFEfG33CzJE3qJ22wW50hkobhwFhIhDs0VjXIJXINzgFVNgA+hCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:21:59.932912Z","bundle_sha256":"622ca2d8b6f69d7e77b4dca704ec7f6e830e5b764875323046282f2f5c214001"}}