{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PVAGTO3JIQJNF3PMX6QB5XK2QW","short_pith_number":"pith:PVAGTO3J","canonical_record":{"source":{"id":"1411.3504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-13T11:22:58Z","cross_cats_sorted":[],"title_canon_sha256":"a3c1a128ff04c37e1b56d7ba14bcf3aae9c52b31cdaadda4353a4dde35a15471","abstract_canon_sha256":"2e64a4614fd9c8c038ac0643b5d3c29620a7f88784c08a42817c6b93c452ed10"},"schema_version":"1.0"},"canonical_sha256":"7d4069bb694412d2edecbfa01edd5a85a69d2d5dbdc06df79c6f7dc1298df5c8","source":{"kind":"arxiv","id":"1411.3504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3504","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3504v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3504","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"PVAGTO3JIQJN","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PVAGTO3JIQJNF3PM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PVAGTO3J","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PVAGTO3JIQJNF3PMX6QB5XK2QW","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-13T11:22:58Z","cross_cats_sorted":[],"title_canon_sha256":"a3c1a128ff04c37e1b56d7ba14bcf3aae9c52b31cdaadda4353a4dde35a15471","abstract_canon_sha256":"2e64a4614fd9c8c038ac0643b5d3c29620a7f88784c08a42817c6b93c452ed10"},"schema_version":"1.0"},"canonical_sha256":"7d4069bb694412d2edecbfa01edd5a85a69d2d5dbdc06df79c6f7dc1298df5c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.592901Z","signature_b64":"MgZu4ymaut0qsr8edAoaQBB0NhUqXEEcn7jhBIklYY/DjgsXBzWxkpnU+JyZNUJzc4gULIxy64xJr51KzRCcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d4069bb694412d2edecbfa01edd5a85a69d2d5dbdc06df79c6f7dc1298df5c8","last_reissued_at":"2026-05-18T02:37:43.592524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.592524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3504","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gnvg7cAYzF3Tlq8WV1zjyIPTQtlsZdZkUjujRh7PKqAHoYEKg2hWPVCwAOkH5jC/tjs4kZNxJtvYyvSdgH2IDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:37:32.650480Z"},"content_sha256":"ba4105861f41a522513cb8a9d98b9df1f8e657406b0f8890434798b5cb5eedb1","schema_version":"1.0","event_id":"sha256:ba4105861f41a522513cb8a9d98b9df1f8e657406b0f8890434798b5cb5eedb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PVAGTO3JIQJNF3PMX6QB5XK2QW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An extension of Mantel's theorem to random 4-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kang Yang, Ran Gu, Xueliang Li, Yongtang Shi, Zhongmei Qin","submitted_at":"2014-11-13T11:22:58Z","abstract_excerpt":"A sparse version of Mantel's Theorem is that, for sufficiently large $p$, with high probability (w.h.p.), every maximum triangle-free subgraph of $G(n,p)$ is bipartite. 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 the best possible. Denote by $T_3$ the 3-uniform hypergraph with vertex set $\\{a,b,c,d,e\\}$ and edge set $\\{abc,ade,bde\\}$. Frankl and F\\\"uredi showed that the maximum 3-uniform hypergraph on $n$ vertices containing no copy of $T_3$ is tripartite for $n> 3000$. For some integer $k$, let $G^k(n,p)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3504","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h31Gh9LlXAh4+0yCpcDE8isoqWCP+HxFmTrZ21DEIZ54CQct4gC+F+s+npMQ/ty2SoUw3lM6JsT5qaHRdvp+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:37:32.650821Z"},"content_sha256":"632949aa3e1eb9b6def560c05fecb8590ca073e3d411bd808e6749fe9ce47b8c","schema_version":"1.0","event_id":"sha256:632949aa3e1eb9b6def560c05fecb8590ca073e3d411bd808e6749fe9ce47b8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW/bundle.json","state_url":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW/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-03T10:37:32Z","links":{"resolver":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW","bundle":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW/bundle.json","state":"https://pith.science/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVAGTO3JIQJNF3PMX6QB5XK2QW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PVAGTO3JIQJNF3PMX6QB5XK2QW","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":"2e64a4614fd9c8c038ac0643b5d3c29620a7f88784c08a42817c6b93c452ed10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-13T11:22:58Z","title_canon_sha256":"a3c1a128ff04c37e1b56d7ba14bcf3aae9c52b31cdaadda4353a4dde35a15471"},"schema_version":"1.0","source":{"id":"1411.3504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3504","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3504v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3504","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"PVAGTO3JIQJN","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PVAGTO3JIQJNF3PM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PVAGTO3J","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:632949aa3e1eb9b6def560c05fecb8590ca073e3d411bd808e6749fe9ce47b8c","target":"graph","created_at":"2026-05-18T02:37:43Z","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 sparse version of Mantel's Theorem is that, for sufficiently large $p$, with high probability (w.h.p.), every maximum triangle-free subgraph of $G(n,p)$ is bipartite. 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 the best possible. Denote by $T_3$ the 3-uniform hypergraph with vertex set $\\{a,b,c,d,e\\}$ and edge set $\\{abc,ade,bde\\}$. Frankl and F\\\"uredi showed that the maximum 3-uniform hypergraph on $n$ vertices containing no copy of $T_3$ is tripartite for $n> 3000$. For some integer $k$, let $G^k(n,p)","authors_text":"Kang Yang, Ran Gu, Xueliang Li, Yongtang Shi, Zhongmei Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-13T11:22:58Z","title":"An extension of Mantel's theorem to random 4-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3504","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:ba4105861f41a522513cb8a9d98b9df1f8e657406b0f8890434798b5cb5eedb1","target":"record","created_at":"2026-05-18T02:37:43Z","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":"2e64a4614fd9c8c038ac0643b5d3c29620a7f88784c08a42817c6b93c452ed10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-13T11:22:58Z","title_canon_sha256":"a3c1a128ff04c37e1b56d7ba14bcf3aae9c52b31cdaadda4353a4dde35a15471"},"schema_version":"1.0","source":{"id":"1411.3504","kind":"arxiv","version":1}},"canonical_sha256":"7d4069bb694412d2edecbfa01edd5a85a69d2d5dbdc06df79c6f7dc1298df5c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d4069bb694412d2edecbfa01edd5a85a69d2d5dbdc06df79c6f7dc1298df5c8","first_computed_at":"2026-05-18T02:37:43.592524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:43.592524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MgZu4ymaut0qsr8edAoaQBB0NhUqXEEcn7jhBIklYY/DjgsXBzWxkpnU+JyZNUJzc4gULIxy64xJr51KzRCcDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:43.592901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba4105861f41a522513cb8a9d98b9df1f8e657406b0f8890434798b5cb5eedb1","sha256:632949aa3e1eb9b6def560c05fecb8590ca073e3d411bd808e6749fe9ce47b8c"],"state_sha256":"eb63c8e869ae3cb3baaacb6e13ebcef0bbde241e92af84d0499044ca87d70339"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+lRMyAXJh31Iq0UQbT/cgo2gYUumzeCn3cOjm2lT631DZ06TPH+y2bvS3RBxSSqwcs6axRX/0FVYOcqkbbrYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:37:32.654882Z","bundle_sha256":"bcb4cf07cb339bb70de232e7d3239145387d71b84eaa8bf0a5cd35a31c00c140"}}