{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VKZ5TXZQ7KVLRUET5C5RT426HJ","short_pith_number":"pith:VKZ5TXZQ","canonical_record":{"source":{"id":"1201.4326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-20T16:02:34Z","cross_cats_sorted":[],"title_canon_sha256":"40fe4c88bda62f944571f549d299691d20a03d06618c6221630f4835cc13d102","abstract_canon_sha256":"1b14930d2fa8a7db74872a78ab2bb025cb26a7c4b6813b780a27aadd3a7e81ca"},"schema_version":"1.0"},"canonical_sha256":"aab3d9df30faaab8d093e8bb19f35e3a75130b606068be6605d8d6382ee66697","source":{"kind":"arxiv","id":"1201.4326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4326","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4326v1","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4326","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"VKZ5TXZQ7KVL","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VKZ5TXZQ7KVLRUET","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VKZ5TXZQ","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VKZ5TXZQ7KVLRUET5C5RT426HJ","target":"record","payload":{"canonical_record":{"source":{"id":"1201.4326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-20T16:02:34Z","cross_cats_sorted":[],"title_canon_sha256":"40fe4c88bda62f944571f549d299691d20a03d06618c6221630f4835cc13d102","abstract_canon_sha256":"1b14930d2fa8a7db74872a78ab2bb025cb26a7c4b6813b780a27aadd3a7e81ca"},"schema_version":"1.0"},"canonical_sha256":"aab3d9df30faaab8d093e8bb19f35e3a75130b606068be6605d8d6382ee66697","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:11.245401Z","signature_b64":"Gzj74vKyr7dSYohFPDYpnwkEaHHCzAU0obbqkbkeI3J5aANGPBfgchomaaLbzYH1qwTuQT8W1Wp3wkbM6ykxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aab3d9df30faaab8d093e8bb19f35e3a75130b606068be6605d8d6382ee66697","last_reissued_at":"2026-05-18T02:25:11.244963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:11.244963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.4326","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZkRrKhDZMm7Orj6CcEcR/aNIzkhOYxP1Gjcw26FG9LjSOtb1IzefaURpSnRrKqJ3GcUCHxEoYQAZxpSKMpYPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:56:15.097975Z"},"content_sha256":"08550dc34b1185acd2b90462b44000157aa52acef0de6ad7cb07e7384a2e8684","schema_version":"1.0","event_id":"sha256:08550dc34b1185acd2b90462b44000157aa52acef0de6ad7cb07e7384a2e8684"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VKZ5TXZQ7KVLRUET5C5RT426HJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tur\\'an H-densities for 3-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emil R. Vaughan, Victor Falgas-Ravry","submitted_at":"2012-01-20T16:02:34Z","abstract_excerpt":"Given an $r$-graph $H$ on $h$ vertices, and a family $\\mathcal{F}$ of forbidden subgraphs, we define $\\ex_{H}(n, \\mathcal{F})$ to be the maximum number of induced copies of $H$ in an $\\mathcal{F}$-free $r$-graph on $n$ vertices.\n  Then the \\emph{Tur\\'an $H$-density} of $\\mathcal{F}$ is the limit \\[\\pi_{H}(\\mathcal{F})= \\lim_{n\\rightarrow \\infty}\\ex_{H}(n, \\mathcal{F})/\\binom{n}{h}. \\]\n  This generalises the notions of \\emph{Tur\\'an density} (when $H$ is an $r$-edge), and \\emph{inducibility} (when $\\mathcal{F}$ is empty). Although problems of this kind have received some attention, very few res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4326","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MX1QBAUouoOENW2iJO00f9SmHsiKGtnAVwgd5j7Y5YjW1HdlY5YrpjHUdamC0MCchH6fOLsKNT1eo7z0EfpYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:56:15.098346Z"},"content_sha256":"b095372b1e1f4e932ff7fe3097eb01d51c6ffcebf10df05d2b464f6fa41ec656","schema_version":"1.0","event_id":"sha256:b095372b1e1f4e932ff7fe3097eb01d51c6ffcebf10df05d2b464f6fa41ec656"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKZ5TXZQ7KVLRUET5C5RT426HJ/bundle.json","state_url":"https://pith.science/pith/VKZ5TXZQ7KVLRUET5C5RT426HJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKZ5TXZQ7KVLRUET5C5RT426HJ/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-03T09:56:15Z","links":{"resolver":"https://pith.science/pith/VKZ5TXZQ7KVLRUET5C5RT426HJ","bundle":"https://pith.science/pith/VKZ5TXZQ7KVLRUET5C5RT426HJ/bundle.json","state":"https://pith.science/pith/VKZ5TXZQ7KVLRUET5C5RT426HJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKZ5TXZQ7KVLRUET5C5RT426HJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VKZ5TXZQ7KVLRUET5C5RT426HJ","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":"1b14930d2fa8a7db74872a78ab2bb025cb26a7c4b6813b780a27aadd3a7e81ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-20T16:02:34Z","title_canon_sha256":"40fe4c88bda62f944571f549d299691d20a03d06618c6221630f4835cc13d102"},"schema_version":"1.0","source":{"id":"1201.4326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4326","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4326v1","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4326","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"VKZ5TXZQ7KVL","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VKZ5TXZQ7KVLRUET","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VKZ5TXZQ","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:b095372b1e1f4e932ff7fe3097eb01d51c6ffcebf10df05d2b464f6fa41ec656","target":"graph","created_at":"2026-05-18T02:25:11Z","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 an $r$-graph $H$ on $h$ vertices, and a family $\\mathcal{F}$ of forbidden subgraphs, we define $\\ex_{H}(n, \\mathcal{F})$ to be the maximum number of induced copies of $H$ in an $\\mathcal{F}$-free $r$-graph on $n$ vertices.\n  Then the \\emph{Tur\\'an $H$-density} of $\\mathcal{F}$ is the limit \\[\\pi_{H}(\\mathcal{F})= \\lim_{n\\rightarrow \\infty}\\ex_{H}(n, \\mathcal{F})/\\binom{n}{h}. \\]\n  This generalises the notions of \\emph{Tur\\'an density} (when $H$ is an $r$-edge), and \\emph{inducibility} (when $\\mathcal{F}$ is empty). Although problems of this kind have received some attention, very few res","authors_text":"Emil R. Vaughan, Victor Falgas-Ravry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-20T16:02:34Z","title":"Tur\\'an H-densities for 3-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4326","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:08550dc34b1185acd2b90462b44000157aa52acef0de6ad7cb07e7384a2e8684","target":"record","created_at":"2026-05-18T02:25:11Z","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":"1b14930d2fa8a7db74872a78ab2bb025cb26a7c4b6813b780a27aadd3a7e81ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-20T16:02:34Z","title_canon_sha256":"40fe4c88bda62f944571f549d299691d20a03d06618c6221630f4835cc13d102"},"schema_version":"1.0","source":{"id":"1201.4326","kind":"arxiv","version":1}},"canonical_sha256":"aab3d9df30faaab8d093e8bb19f35e3a75130b606068be6605d8d6382ee66697","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aab3d9df30faaab8d093e8bb19f35e3a75130b606068be6605d8d6382ee66697","first_computed_at":"2026-05-18T02:25:11.244963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:11.244963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gzj74vKyr7dSYohFPDYpnwkEaHHCzAU0obbqkbkeI3J5aANGPBfgchomaaLbzYH1qwTuQT8W1Wp3wkbM6ykxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:11.245401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.4326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08550dc34b1185acd2b90462b44000157aa52acef0de6ad7cb07e7384a2e8684","sha256:b095372b1e1f4e932ff7fe3097eb01d51c6ffcebf10df05d2b464f6fa41ec656"],"state_sha256":"412b68386747f1ff2e7299b7db3af1bf10bf85a75b0b938bde90507175e2179e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ud6slaKebRhZCvbP7H8fIQ25vMFkVdaDuBq4WGQgrFZh5ca2ft+UmffH2QMMVMA5Kk7WpqEg3lutnf+flPOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:56:15.100371Z","bundle_sha256":"23c46a42c62bb1fe2dec8a865c06b7f7c030962defb34e71b0c8027698960c08"}}