{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WJ4RJMIQDCWLAK2YT4DRBSCM6U","short_pith_number":"pith:WJ4RJMIQ","canonical_record":{"source":{"id":"1510.03461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-12T20:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"8dfd77af40cdd07e13a3a41cb39d500891f4b022b3d65513e0a92a70011b851b","abstract_canon_sha256":"50478064900c5ac5c190302d0d9e368bae8605bc0b0c65d07b9ccca859b4f279"},"schema_version":"1.0"},"canonical_sha256":"b27914b11018acb02b589f0710c84cf52cff73461fbfa7bb1b5c3af9dbfd4cc4","source":{"kind":"arxiv","id":"1510.03461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03461","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03461v1","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03461","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"WJ4RJMIQDCWL","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WJ4RJMIQDCWLAK2Y","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WJ4RJMIQ","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WJ4RJMIQDCWLAK2YT4DRBSCM6U","target":"record","payload":{"canonical_record":{"source":{"id":"1510.03461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-12T20:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"8dfd77af40cdd07e13a3a41cb39d500891f4b022b3d65513e0a92a70011b851b","abstract_canon_sha256":"50478064900c5ac5c190302d0d9e368bae8605bc0b0c65d07b9ccca859b4f279"},"schema_version":"1.0"},"canonical_sha256":"b27914b11018acb02b589f0710c84cf52cff73461fbfa7bb1b5c3af9dbfd4cc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:17.154823Z","signature_b64":"kCIssvf++T8HLJmfAJMbzsoI2zqiiXMwjYQok8xFmSnW69smZrkjGcK8Go6QruOzeIv9JLt1snKRCx4qPaRXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b27914b11018acb02b589f0710c84cf52cff73461fbfa7bb1b5c3af9dbfd4cc4","last_reissued_at":"2026-05-18T01:30:17.154060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:17.154060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.03461","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:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/w1rsQBpCGiFnWJjTUO9LBhx+OHl1u5Mak/S6XUUvSWs/6yQBNd2/8AU1NHyRe3aS6CHReuB98h6X/LlyIsxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:07:14.754021Z"},"content_sha256":"7f5292a0ddd01dcb1bd7b8ed24578a6b3fe9c1b9e48b8a37383e23e5bb2bbb50","schema_version":"1.0","event_id":"sha256:7f5292a0ddd01dcb1bd7b8ed24578a6b3fe9c1b9e48b8a37383e23e5bb2bbb50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WJ4RJMIQDCWLAK2YT4DRBSCM6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability and Tur\\'an numbers of a class of hypergraphs via Lagrangians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Axel Brandt, David Irwin, Tao Jiang","submitted_at":"2015-10-12T20:59:21Z","abstract_excerpt":"Given a family of $r$-uniform hypergraphs ${\\cal F}$ (or $r$-graphs for brevity), the Tur\\'an number $ex(n,{\\cal F})$ of ${\\cal F}$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain any member of ${\\cal F}$. A pair $\\{u,v\\}$ is covered in a hypergraph $G$ if some edge of $G$ contains $\\{u,v\\}$. Given an $r$-graph $F$ and a positive integer $p\\geq n(F)$, let $H^F_p$ denote the $r$-graph obtained as follows. Label the vertices of $F$ as $v_1,\\ldots, v_{n(F)}$. Add new vertices $v_{n(F)+1},\\ldots, v_p$. For each pair of vertices $v_i,v_j$ not covered in $F$, add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03461","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:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Av3lUp1Sqr4JvgoKqKVtvtUU2gYQatszXB/KoSIptlMhQfzOWCutRSYNSlC/7vc4VGVQn8bmoamJHYStkTuQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:07:14.754435Z"},"content_sha256":"54fe999903bec765c79ab77df6b502de001d602e3cf1fcd7c0ee57870d16b28d","schema_version":"1.0","event_id":"sha256:54fe999903bec765c79ab77df6b502de001d602e3cf1fcd7c0ee57870d16b28d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJ4RJMIQDCWLAK2YT4DRBSCM6U/bundle.json","state_url":"https://pith.science/pith/WJ4RJMIQDCWLAK2YT4DRBSCM6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJ4RJMIQDCWLAK2YT4DRBSCM6U/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-02T00:07:14Z","links":{"resolver":"https://pith.science/pith/WJ4RJMIQDCWLAK2YT4DRBSCM6U","bundle":"https://pith.science/pith/WJ4RJMIQDCWLAK2YT4DRBSCM6U/bundle.json","state":"https://pith.science/pith/WJ4RJMIQDCWLAK2YT4DRBSCM6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJ4RJMIQDCWLAK2YT4DRBSCM6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WJ4RJMIQDCWLAK2YT4DRBSCM6U","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":"50478064900c5ac5c190302d0d9e368bae8605bc0b0c65d07b9ccca859b4f279","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-12T20:59:21Z","title_canon_sha256":"8dfd77af40cdd07e13a3a41cb39d500891f4b022b3d65513e0a92a70011b851b"},"schema_version":"1.0","source":{"id":"1510.03461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03461","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03461v1","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03461","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"WJ4RJMIQDCWL","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WJ4RJMIQDCWLAK2Y","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WJ4RJMIQ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:54fe999903bec765c79ab77df6b502de001d602e3cf1fcd7c0ee57870d16b28d","target":"graph","created_at":"2026-05-18T01:30:17Z","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":"Given a family of $r$-uniform hypergraphs ${\\cal F}$ (or $r$-graphs for brevity), the Tur\\'an number $ex(n,{\\cal F})$ of ${\\cal F}$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain any member of ${\\cal F}$. A pair $\\{u,v\\}$ is covered in a hypergraph $G$ if some edge of $G$ contains $\\{u,v\\}$. Given an $r$-graph $F$ and a positive integer $p\\geq n(F)$, let $H^F_p$ denote the $r$-graph obtained as follows. Label the vertices of $F$ as $v_1,\\ldots, v_{n(F)}$. Add new vertices $v_{n(F)+1},\\ldots, v_p$. For each pair of vertices $v_i,v_j$ not covered in $F$, add","authors_text":"Axel Brandt, David Irwin, Tao Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-12T20:59:21Z","title":"Stability and Tur\\'an numbers of a class of hypergraphs via Lagrangians"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03461","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:7f5292a0ddd01dcb1bd7b8ed24578a6b3fe9c1b9e48b8a37383e23e5bb2bbb50","target":"record","created_at":"2026-05-18T01:30:17Z","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":"50478064900c5ac5c190302d0d9e368bae8605bc0b0c65d07b9ccca859b4f279","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-12T20:59:21Z","title_canon_sha256":"8dfd77af40cdd07e13a3a41cb39d500891f4b022b3d65513e0a92a70011b851b"},"schema_version":"1.0","source":{"id":"1510.03461","kind":"arxiv","version":1}},"canonical_sha256":"b27914b11018acb02b589f0710c84cf52cff73461fbfa7bb1b5c3af9dbfd4cc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b27914b11018acb02b589f0710c84cf52cff73461fbfa7bb1b5c3af9dbfd4cc4","first_computed_at":"2026-05-18T01:30:17.154060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:17.154060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kCIssvf++T8HLJmfAJMbzsoI2zqiiXMwjYQok8xFmSnW69smZrkjGcK8Go6QruOzeIv9JLt1snKRCx4qPaRXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:17.154823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f5292a0ddd01dcb1bd7b8ed24578a6b3fe9c1b9e48b8a37383e23e5bb2bbb50","sha256:54fe999903bec765c79ab77df6b502de001d602e3cf1fcd7c0ee57870d16b28d"],"state_sha256":"e7cd60bfc6f6a240a50e67266ba2740fe34760db16ae83aa23818882746f408d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6rDlkSF9v7FwXveGm5GBJVJ+r+MZvsjdwm00UASrtPlWT6Ry9KKgb+wd8mPJ3+L51y2QWC2iO9dEUdPBjHgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:07:14.756382Z","bundle_sha256":"4dfc597690a73276be3750fb316bcecf73d4dc751d4858e3b847bea389690263"}}