{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CVDV6UXLLLWBHLYFPFZ5JFBYLV","short_pith_number":"pith:CVDV6UXL","canonical_record":{"source":{"id":"1307.8423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-31T18:53:10Z","cross_cats_sorted":[],"title_canon_sha256":"ad6259da365e6b75f5c420cd0ccb46c697325b83e6340478b15a578ea45f8235","abstract_canon_sha256":"73a8dd09b2e1585782330743b7871c1dd266f3262bce543728dfbf59af0f315f"},"schema_version":"1.0"},"canonical_sha256":"15475f52eb5aec13af057973d494385d4f773007e8789651fc0bce728a7b035d","source":{"kind":"arxiv","id":"1307.8423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8423","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8423v1","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8423","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"pith_short_12","alias_value":"CVDV6UXLLLWB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CVDV6UXLLLWBHLYF","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CVDV6UXL","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CVDV6UXLLLWBHLYFPFZ5JFBYLV","target":"record","payload":{"canonical_record":{"source":{"id":"1307.8423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-31T18:53:10Z","cross_cats_sorted":[],"title_canon_sha256":"ad6259da365e6b75f5c420cd0ccb46c697325b83e6340478b15a578ea45f8235","abstract_canon_sha256":"73a8dd09b2e1585782330743b7871c1dd266f3262bce543728dfbf59af0f315f"},"schema_version":"1.0"},"canonical_sha256":"15475f52eb5aec13af057973d494385d4f773007e8789651fc0bce728a7b035d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:01.186722Z","signature_b64":"9Qsk7vI5HIPBrubZoYl6Sg7o573Oj5GCtdC4Cx5q3PNlkR625ZrLytjzVdHUWBWmcIP2al2OINEiBGtYhhHcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15475f52eb5aec13af057973d494385d4f773007e8789651fc0bce728a7b035d","last_reissued_at":"2026-05-18T03:17:01.185991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:01.185991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.8423","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-18T03:17:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nu2JsECEZ+MqRkdht3w4C581nip6FuZQKXHwp3rhEOYtTaoXOsTolqRtUgEwF07r4GpcJVhpLa5HcR45F1WQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:36:09.270757Z"},"content_sha256":"de02ccdc06fef5596a4a8376da8ffa0ee8b3e39dacb8087d16cb0331c74fa176","schema_version":"1.0","event_id":"sha256:de02ccdc06fef5596a4a8376da8ffa0ee8b3e39dacb8087d16cb0331c74fa176"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CVDV6UXLLLWBHLYFPFZ5JFBYLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A hypergraph Tur\\'an theorem via lagrangians of intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Hefetz, Peter Keevash","submitted_at":"2013-07-31T18:53:10Z","abstract_excerpt":"Let $\\mc{K}_{3,3}^3$ be the 3-graph with 15 vertices $\\{x_i, y_i: 1 \\le i \\le 3\\}$ and $\\{z_{ij}: 1 \\le i,j \\le 3\\}$, and 11 edges $\\{x_1, x_2, x_3\\}$, $\\{y_1, y_2, y_3\\}$ and $\\{\\{x_i, y_j, z_{ij}\\}: 1 \\le i,j \\le 3\\}$. We show that for large $n$, the unique largest $\\mc{K}_{3,3}^3$-free 3-graph on $n$ vertices is a balanced blow-up of the complete 3-graph on 5 vertices. Our proof uses the stability method and a result on lagrangians of intersecting families that has independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8423","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-18T03:17:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JRp3g7LNIPFph8oKerSFp5jyFo2T5YQL+Ok58XFhBozbHfcgKrbb9wm6pxm65q4U3ZAJl99GaJFnXgEyF+ZiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:36:09.271472Z"},"content_sha256":"59fb58a4945b65ff9c61b928bd1b7968b09d5afd9bf0b3ed836208d0fbe21097","schema_version":"1.0","event_id":"sha256:59fb58a4945b65ff9c61b928bd1b7968b09d5afd9bf0b3ed836208d0fbe21097"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVDV6UXLLLWBHLYFPFZ5JFBYLV/bundle.json","state_url":"https://pith.science/pith/CVDV6UXLLLWBHLYFPFZ5JFBYLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVDV6UXLLLWBHLYFPFZ5JFBYLV/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-30T07:36:09Z","links":{"resolver":"https://pith.science/pith/CVDV6UXLLLWBHLYFPFZ5JFBYLV","bundle":"https://pith.science/pith/CVDV6UXLLLWBHLYFPFZ5JFBYLV/bundle.json","state":"https://pith.science/pith/CVDV6UXLLLWBHLYFPFZ5JFBYLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVDV6UXLLLWBHLYFPFZ5JFBYLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CVDV6UXLLLWBHLYFPFZ5JFBYLV","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":"73a8dd09b2e1585782330743b7871c1dd266f3262bce543728dfbf59af0f315f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-31T18:53:10Z","title_canon_sha256":"ad6259da365e6b75f5c420cd0ccb46c697325b83e6340478b15a578ea45f8235"},"schema_version":"1.0","source":{"id":"1307.8423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8423","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8423v1","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8423","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"pith_short_12","alias_value":"CVDV6UXLLLWB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CVDV6UXLLLWBHLYF","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CVDV6UXL","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:59fb58a4945b65ff9c61b928bd1b7968b09d5afd9bf0b3ed836208d0fbe21097","target":"graph","created_at":"2026-05-18T03:17:01Z","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":"Let $\\mc{K}_{3,3}^3$ be the 3-graph with 15 vertices $\\{x_i, y_i: 1 \\le i \\le 3\\}$ and $\\{z_{ij}: 1 \\le i,j \\le 3\\}$, and 11 edges $\\{x_1, x_2, x_3\\}$, $\\{y_1, y_2, y_3\\}$ and $\\{\\{x_i, y_j, z_{ij}\\}: 1 \\le i,j \\le 3\\}$. We show that for large $n$, the unique largest $\\mc{K}_{3,3}^3$-free 3-graph on $n$ vertices is a balanced blow-up of the complete 3-graph on 5 vertices. Our proof uses the stability method and a result on lagrangians of intersecting families that has independent interest.","authors_text":"Dan Hefetz, Peter Keevash","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-31T18:53:10Z","title":"A hypergraph Tur\\'an theorem via lagrangians of intersecting families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8423","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:de02ccdc06fef5596a4a8376da8ffa0ee8b3e39dacb8087d16cb0331c74fa176","target":"record","created_at":"2026-05-18T03:17:01Z","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":"73a8dd09b2e1585782330743b7871c1dd266f3262bce543728dfbf59af0f315f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-31T18:53:10Z","title_canon_sha256":"ad6259da365e6b75f5c420cd0ccb46c697325b83e6340478b15a578ea45f8235"},"schema_version":"1.0","source":{"id":"1307.8423","kind":"arxiv","version":1}},"canonical_sha256":"15475f52eb5aec13af057973d494385d4f773007e8789651fc0bce728a7b035d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15475f52eb5aec13af057973d494385d4f773007e8789651fc0bce728a7b035d","first_computed_at":"2026-05-18T03:17:01.185991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:01.185991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Qsk7vI5HIPBrubZoYl6Sg7o573Oj5GCtdC4Cx5q3PNlkR625ZrLytjzVdHUWBWmcIP2al2OINEiBGtYhhHcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:01.186722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.8423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de02ccdc06fef5596a4a8376da8ffa0ee8b3e39dacb8087d16cb0331c74fa176","sha256:59fb58a4945b65ff9c61b928bd1b7968b09d5afd9bf0b3ed836208d0fbe21097"],"state_sha256":"c6cef386ae855ca3a73339b9ed4c3d4804a896bc641eb5a58e92a01f5ed74910"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ko43F28QLEJL88NuSxJaHw/ead8EMk3pDHq15sTf/3Fl9gmY1yGu+iqM3f4heg3TjGAjZlzHLgUfsuMvvem6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:36:09.275333Z","bundle_sha256":"8fef51e41c3c797273272d5c2a1f53d123b618cf858d98b6874b37f93374441c"}}