{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PZXKAXZ54UUHU72S3UTNC6WQUN","short_pith_number":"pith:PZXKAXZ5","canonical_record":{"source":{"id":"1801.01047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-03T15:22:10Z","cross_cats_sorted":[],"title_canon_sha256":"3247960c7c0944fc694f59e40e60afa014992633af46d1193da04473cc6ae7e4","abstract_canon_sha256":"d8a6722542488de3c7f37b2fae2f393762d3b800b5c225221e1f1ad991162150"},"schema_version":"1.0"},"canonical_sha256":"7e6ea05f3de5287a7f52dd26d17ad0a36d431c237e40da0a2ca62d1b631f3bf6","source":{"kind":"arxiv","id":"1801.01047","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01047","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01047v2","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01047","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"pith_short_12","alias_value":"PZXKAXZ54UUH","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PZXKAXZ54UUHU72S","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PZXKAXZ5","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PZXKAXZ54UUHU72S3UTNC6WQUN","target":"record","payload":{"canonical_record":{"source":{"id":"1801.01047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-03T15:22:10Z","cross_cats_sorted":[],"title_canon_sha256":"3247960c7c0944fc694f59e40e60afa014992633af46d1193da04473cc6ae7e4","abstract_canon_sha256":"d8a6722542488de3c7f37b2fae2f393762d3b800b5c225221e1f1ad991162150"},"schema_version":"1.0"},"canonical_sha256":"7e6ea05f3de5287a7f52dd26d17ad0a36d431c237e40da0a2ca62d1b631f3bf6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:07.240878Z","signature_b64":"C5NDudfsqPfrz9sZrFjUJ/5yO2j46KYwT59mlTuit1JnwAfk57rTktYzB41heLD9sNWcbpj0EDPk/OMPaZPVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e6ea05f3de5287a7f52dd26d17ad0a36d431c237e40da0a2ca62d1b631f3bf6","last_reissued_at":"2026-05-18T00:26:07.240272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:07.240272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.01047","source_version":2,"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-18T00:26:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"702+4wSd6Tn8E4AxFyhc7T8ptAJK/c4/67JfFhBFFwHOcdTJQU81lRowzraLbkW08CMMfuS5zcL2zSuFS7XfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:56:55.390617Z"},"content_sha256":"bcd2123dbe75f6ae6e9ad34dafcb3d5c164710c06c3adcd04d920eb84e077be5","schema_version":"1.0","event_id":"sha256:bcd2123dbe75f6ae6e9ad34dafcb3d5c164710c06c3adcd04d920eb84e077be5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PZXKAXZ54UUHU72S3UTNC6WQUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the exact maximum induced density of almost all graphs and their inducibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Raphael Yuster","submitted_at":"2018-01-03T15:22:10Z","abstract_excerpt":"Let $H$ be a graph on $h$ vertices. The number of induced copies of $H$ in a graph $G$ is denoted by $i_H(G)$. Let $i_H(n)$ denote the maximum of $i_H(G)$ taken over all graphs $G$ with $n$ vertices.\n  Let $f(n,h) = \\Pi_{i}^h a_i$ where $\\sum_{i=1}^h a_i = n$ and the $a_i$ are as equal as possible. Let $g(n,h) = f(n,h) + \\sum_{i=1}^h g(a_i,h)$. It is proved that for almost all graphs $H$ on $h$ vertices it holds that $i_H(n)=g(n,h)$ for all $n \\le 2^{\\sqrt{h}}$. More precisely, we define an explicit graph property ${\\cal P}_h$ which, when satisfied by $H$, guarantees that $i_H(n)=g(n,h)$ for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01047","kind":"arxiv","version":2},"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-18T00:26:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"csDdrRB9vPDqj1geJAzzhEhao73etcQUPG9ycJBAtX1VygJTelbeOrse2OZFX7w7a0bBjLz28lw/DvtNc0lpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:56:55.390957Z"},"content_sha256":"f9689b6f4ae35c02e730c7bf42da0764db5e3622654a5e2e8f245e2100ebc8a8","schema_version":"1.0","event_id":"sha256:f9689b6f4ae35c02e730c7bf42da0764db5e3622654a5e2e8f245e2100ebc8a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZXKAXZ54UUHU72S3UTNC6WQUN/bundle.json","state_url":"https://pith.science/pith/PZXKAXZ54UUHU72S3UTNC6WQUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZXKAXZ54UUHU72S3UTNC6WQUN/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-19T11:56:55Z","links":{"resolver":"https://pith.science/pith/PZXKAXZ54UUHU72S3UTNC6WQUN","bundle":"https://pith.science/pith/PZXKAXZ54UUHU72S3UTNC6WQUN/bundle.json","state":"https://pith.science/pith/PZXKAXZ54UUHU72S3UTNC6WQUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZXKAXZ54UUHU72S3UTNC6WQUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PZXKAXZ54UUHU72S3UTNC6WQUN","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":"d8a6722542488de3c7f37b2fae2f393762d3b800b5c225221e1f1ad991162150","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-03T15:22:10Z","title_canon_sha256":"3247960c7c0944fc694f59e40e60afa014992633af46d1193da04473cc6ae7e4"},"schema_version":"1.0","source":{"id":"1801.01047","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01047","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01047v2","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01047","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"pith_short_12","alias_value":"PZXKAXZ54UUH","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PZXKAXZ54UUHU72S","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PZXKAXZ5","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:f9689b6f4ae35c02e730c7bf42da0764db5e3622654a5e2e8f245e2100ebc8a8","target":"graph","created_at":"2026-05-18T00:26:07Z","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 $H$ be a graph on $h$ vertices. The number of induced copies of $H$ in a graph $G$ is denoted by $i_H(G)$. Let $i_H(n)$ denote the maximum of $i_H(G)$ taken over all graphs $G$ with $n$ vertices.\n  Let $f(n,h) = \\Pi_{i}^h a_i$ where $\\sum_{i=1}^h a_i = n$ and the $a_i$ are as equal as possible. Let $g(n,h) = f(n,h) + \\sum_{i=1}^h g(a_i,h)$. It is proved that for almost all graphs $H$ on $h$ vertices it holds that $i_H(n)=g(n,h)$ for all $n \\le 2^{\\sqrt{h}}$. More precisely, we define an explicit graph property ${\\cal P}_h$ which, when satisfied by $H$, guarantees that $i_H(n)=g(n,h)$ for a","authors_text":"Raphael Yuster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-03T15:22:10Z","title":"On the exact maximum induced density of almost all graphs and their inducibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01047","kind":"arxiv","version":2},"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:bcd2123dbe75f6ae6e9ad34dafcb3d5c164710c06c3adcd04d920eb84e077be5","target":"record","created_at":"2026-05-18T00:26:07Z","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":"d8a6722542488de3c7f37b2fae2f393762d3b800b5c225221e1f1ad991162150","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-03T15:22:10Z","title_canon_sha256":"3247960c7c0944fc694f59e40e60afa014992633af46d1193da04473cc6ae7e4"},"schema_version":"1.0","source":{"id":"1801.01047","kind":"arxiv","version":2}},"canonical_sha256":"7e6ea05f3de5287a7f52dd26d17ad0a36d431c237e40da0a2ca62d1b631f3bf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e6ea05f3de5287a7f52dd26d17ad0a36d431c237e40da0a2ca62d1b631f3bf6","first_computed_at":"2026-05-18T00:26:07.240272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:07.240272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C5NDudfsqPfrz9sZrFjUJ/5yO2j46KYwT59mlTuit1JnwAfk57rTktYzB41heLD9sNWcbpj0EDPk/OMPaZPVDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:07.240878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01047","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcd2123dbe75f6ae6e9ad34dafcb3d5c164710c06c3adcd04d920eb84e077be5","sha256:f9689b6f4ae35c02e730c7bf42da0764db5e3622654a5e2e8f245e2100ebc8a8"],"state_sha256":"23015d03a61a8c24d1e856b6a9c6b2997e198fe8635c1ea5dd23e1e717ba5ee5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ioOfTM/HHuUgr/NXM+n7AMglNK67yAxzny/IaoIDknH3VLs7VyLtl+VQ39abzjXtWf3Fixvan6iw83C+ELarDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T11:56:55.392537Z","bundle_sha256":"9585d6d3eb504e1c7a42c814dfaf1f9ca2774a94ad4b72412609b2871353eaa3"}}