{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3LJTKNCQ7WI6OX6YE7OHG2Y7TY","short_pith_number":"pith:3LJTKNCQ","canonical_record":{"source":{"id":"2411.17362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T12:08:14Z","cross_cats_sorted":[],"title_canon_sha256":"76356d296a4c5a08df0186803bfa155a250fa695299296adff364d2fd95b2f24","abstract_canon_sha256":"1da9978dcb68845eec04d32a8ed07b12cb1a3f4ea0b020581cadb15ccc0ef9ba"},"schema_version":"1.0"},"canonical_sha256":"dad3353450fd91e75fd827dc736b1f9e0c13a2babbc99d5cd48ecdb775dc8b86","source":{"kind":"arxiv","id":"2411.17362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17362","created_at":"2026-07-05T09:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17362v1","created_at":"2026-07-05T09:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17362","created_at":"2026-07-05T09:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"3LJTKNCQ7WI6","created_at":"2026-07-05T09:40:46Z"},{"alias_kind":"pith_short_16","alias_value":"3LJTKNCQ7WI6OX6Y","created_at":"2026-07-05T09:40:46Z"},{"alias_kind":"pith_short_8","alias_value":"3LJTKNCQ","created_at":"2026-07-05T09:40:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3LJTKNCQ7WI6OX6YE7OHG2Y7TY","target":"record","payload":{"canonical_record":{"source":{"id":"2411.17362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T12:08:14Z","cross_cats_sorted":[],"title_canon_sha256":"76356d296a4c5a08df0186803bfa155a250fa695299296adff364d2fd95b2f24","abstract_canon_sha256":"1da9978dcb68845eec04d32a8ed07b12cb1a3f4ea0b020581cadb15ccc0ef9ba"},"schema_version":"1.0"},"canonical_sha256":"dad3353450fd91e75fd827dc736b1f9e0c13a2babbc99d5cd48ecdb775dc8b86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:46.276338Z","signature_b64":"FAfv0vXUXBEcpPCoGtunh9xaxNdD64NYk3fVro2VFJ4YwEz1CvLAxoIPTFRK6IhvtMdPDyH3mGuhI+IVwtBtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dad3353450fd91e75fd827dc736b1f9e0c13a2babbc99d5cd48ecdb775dc8b86","last_reissued_at":"2026-07-05T09:40:46.275819Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:46.275819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.17362","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-07-05T09:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePBaJcUXt4l/Y+OpfD9wIEUJo/gUkMp7/PL65s/ofq/m4mRmdanVOGg8PMnp2x/Haswg5giTVILqbLFtEozEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:15:47.400594Z"},"content_sha256":"0eeb3aa67e934eff572b0545714727227f3a90b2aafc4ce807c7b8fd0f48de25","schema_version":"1.0","event_id":"sha256:0eeb3aa67e934eff572b0545714727227f3a90b2aafc4ce807c7b8fd0f48de25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3LJTKNCQ7WI6OX6YE7OHG2Y7TY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizing graphs with high inducibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Ueltzen","submitted_at":"2024-11-26T12:08:14Z","abstract_excerpt":"For a positive integer $k$ and a graph $H$ on $k$ vertices, we are interested in the inducibility of $H$, denoted $\\mathrm{ind}(H)$, which is defined as the maximum possible probability that choosing $k$ vertices uniformly at random from a large graph $G$, they induce a copy of $H$. It follows from the resolved Edge-statistics conjecture that if $H \\not \\in \\{K_k, \\bar K_k\\}$, then $\\mathrm{ind}(H) \\leq 1 / e + o_k(1)$. Equality holds for the star graph $K_{1, k-1}$, the graph with a single edge on $k$ vertices and their complements. We prove that for all other graphs $H$, we have $\\mathrm{ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17362","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17362/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i2AgDpg6rmj7drHw+afO1r4ETCbKiV+olaZkY2nOr6NumT5PwWFF3Yiw+KtGN4N1oPLJHVagXTOcIxteDsMvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:15:47.401295Z"},"content_sha256":"d1a8948416038e61ed8bc964eb71af9231f021149ac4f470bfcab1beba7506cf","schema_version":"1.0","event_id":"sha256:d1a8948416038e61ed8bc964eb71af9231f021149ac4f470bfcab1beba7506cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LJTKNCQ7WI6OX6YE7OHG2Y7TY/bundle.json","state_url":"https://pith.science/pith/3LJTKNCQ7WI6OX6YE7OHG2Y7TY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LJTKNCQ7WI6OX6YE7OHG2Y7TY/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-08-13T02:15:47Z","links":{"resolver":"https://pith.science/pith/3LJTKNCQ7WI6OX6YE7OHG2Y7TY","bundle":"https://pith.science/pith/3LJTKNCQ7WI6OX6YE7OHG2Y7TY/bundle.json","state":"https://pith.science/pith/3LJTKNCQ7WI6OX6YE7OHG2Y7TY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LJTKNCQ7WI6OX6YE7OHG2Y7TY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3LJTKNCQ7WI6OX6YE7OHG2Y7TY","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":"1da9978dcb68845eec04d32a8ed07b12cb1a3f4ea0b020581cadb15ccc0ef9ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T12:08:14Z","title_canon_sha256":"76356d296a4c5a08df0186803bfa155a250fa695299296adff364d2fd95b2f24"},"schema_version":"1.0","source":{"id":"2411.17362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17362","created_at":"2026-07-05T09:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17362v1","created_at":"2026-07-05T09:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17362","created_at":"2026-07-05T09:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"3LJTKNCQ7WI6","created_at":"2026-07-05T09:40:46Z"},{"alias_kind":"pith_short_16","alias_value":"3LJTKNCQ7WI6OX6Y","created_at":"2026-07-05T09:40:46Z"},{"alias_kind":"pith_short_8","alias_value":"3LJTKNCQ","created_at":"2026-07-05T09:40:46Z"}],"graph_snapshots":[{"event_id":"sha256:d1a8948416038e61ed8bc964eb71af9231f021149ac4f470bfcab1beba7506cf","target":"graph","created_at":"2026-07-05T09:40:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.17362/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a positive integer $k$ and a graph $H$ on $k$ vertices, we are interested in the inducibility of $H$, denoted $\\mathrm{ind}(H)$, which is defined as the maximum possible probability that choosing $k$ vertices uniformly at random from a large graph $G$, they induce a copy of $H$. It follows from the resolved Edge-statistics conjecture that if $H \\not \\in \\{K_k, \\bar K_k\\}$, then $\\mathrm{ind}(H) \\leq 1 / e + o_k(1)$. Equality holds for the star graph $K_{1, k-1}$, the graph with a single edge on $k$ vertices and their complements. We prove that for all other graphs $H$, we have $\\mathrm{ind","authors_text":"Richard Ueltzen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17362","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:0eeb3aa67e934eff572b0545714727227f3a90b2aafc4ce807c7b8fd0f48de25","target":"record","created_at":"2026-07-05T09:40:46Z","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":"1da9978dcb68845eec04d32a8ed07b12cb1a3f4ea0b020581cadb15ccc0ef9ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T12:08:14Z","title_canon_sha256":"76356d296a4c5a08df0186803bfa155a250fa695299296adff364d2fd95b2f24"},"schema_version":"1.0","source":{"id":"2411.17362","kind":"arxiv","version":1}},"canonical_sha256":"dad3353450fd91e75fd827dc736b1f9e0c13a2babbc99d5cd48ecdb775dc8b86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dad3353450fd91e75fd827dc736b1f9e0c13a2babbc99d5cd48ecdb775dc8b86","first_computed_at":"2026-07-05T09:40:46.275819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:46.275819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FAfv0vXUXBEcpPCoGtunh9xaxNdD64NYk3fVro2VFJ4YwEz1CvLAxoIPTFRK6IhvtMdPDyH3mGuhI+IVwtBtCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:46.276338Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eeb3aa67e934eff572b0545714727227f3a90b2aafc4ce807c7b8fd0f48de25","sha256:d1a8948416038e61ed8bc964eb71af9231f021149ac4f470bfcab1beba7506cf"],"state_sha256":"4b8d47e9f18d585c87138c7cc66c81caa21443319ea9ed8964e246fa96603855"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbkbgNtiUnB6zMsrnhl/B5EZWJa9rwZLJFrRobWnNKVSsDm5vsMSS0ETzK6dz9V+9NamREME5mAF3BkovVCGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T02:15:47.406195Z","bundle_sha256":"2c6a1328ab54337f9f677d0c1104d4171d514e8fda412ca928c1bc2825ff67e6"}}