{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:67IT73LWLKMC7UBWLJDWF5Y3UU","short_pith_number":"pith:67IT73LW","canonical_record":{"source":{"id":"2606.00290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T19:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"c88d969061d14959a4ac73606c0b85a4d05cbec83fb529a6ea852097c848f35e","abstract_canon_sha256":"53c25d2921f19018b7547bc7e55ce74789aa50a5051f299e87fcfc8a4d6c4da7"},"schema_version":"1.0"},"canonical_sha256":"f7d13fed765a982fd0365a4762f71ba51e986819f433d445a14821c02d78e922","source":{"kind":"arxiv","id":"2606.00290","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00290","created_at":"2026-06-02T01:03:50Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00290v1","created_at":"2026-06-02T01:03:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00290","created_at":"2026-06-02T01:03:50Z"},{"alias_kind":"pith_short_12","alias_value":"67IT73LWLKMC","created_at":"2026-06-02T01:03:50Z"},{"alias_kind":"pith_short_16","alias_value":"67IT73LWLKMC7UBW","created_at":"2026-06-02T01:03:50Z"},{"alias_kind":"pith_short_8","alias_value":"67IT73LW","created_at":"2026-06-02T01:03:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:67IT73LWLKMC7UBWLJDWF5Y3UU","target":"record","payload":{"canonical_record":{"source":{"id":"2606.00290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T19:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"c88d969061d14959a4ac73606c0b85a4d05cbec83fb529a6ea852097c848f35e","abstract_canon_sha256":"53c25d2921f19018b7547bc7e55ce74789aa50a5051f299e87fcfc8a4d6c4da7"},"schema_version":"1.0"},"canonical_sha256":"f7d13fed765a982fd0365a4762f71ba51e986819f433d445a14821c02d78e922","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:50.807224Z","signature_b64":"lHzmvmh8fTRX66kGKMtrLAERMfXVgl8ZgAGJbrJ6nD0WCntFTNItpuMbkZKZjWrWxIpHBOvUO0/uMdGQUo2iCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7d13fed765a982fd0365a4762f71ba51e986819f433d445a14821c02d78e922","last_reissued_at":"2026-06-02T01:03:50.806811Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:50.806811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.00290","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-06-02T01:03:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehUO7vdAKU3dmEeM89etnfCAIVBhom9oedKTKsOdOpt8H/3gmAIlIRvYcVr9OiHflm1FQYlxjYeVDDzvu5toAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:27:42.297851Z"},"content_sha256":"a8b9a3110693c496e353eb9bfec37d4e4637f1c5b0ee364ac30b28dc13d780e7","schema_version":"1.0","event_id":"sha256:a8b9a3110693c496e353eb9bfec37d4e4637f1c5b0ee364ac30b28dc13d780e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:67IT73LWLKMC7UBWLJDWF5Y3UU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The inducibility of 6-vertex graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jared Le\\'on, Jun Gao, Levente Bodn\\'ar, Oleg Pikhurko, Shumin Sun, Xizhi Liu","submitted_at":"2026-05-29T19:22:36Z","abstract_excerpt":"The inducibility constant $\\lambda_{F}$ of a graph $F$ is the asymptotically maximum induced density of $F$ in a growing sequence of graphs. This paper systematically investigates the case when $F$ has 6 vertices (and there are 78 cases to consider up to isomorphism and complementation). We show that flag algebras can compute the sharp upper bound on $\\lambda_F$ in 36 cases of which, as far as the authors know, 30 are new results. In each of the solved cases, we also prove results about the structure of large (almost) extremal graphs. In particular, we establish perfect stability in all 32 cas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00290","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/2606.00290/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-06-02T01:03:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pUmaJ9krewCTNSibwlLxeBL6+EmPi2u2cG/Elckub/Stzv9Lqo6NjLkN26Tk+dwqHFvTvuiZEiLSI3FX4vscCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:27:42.298230Z"},"content_sha256":"0f61d90a4ffe7206f0d02aa85e488b689fc0288084ea51b259cf49cd40f53c19","schema_version":"1.0","event_id":"sha256:0f61d90a4ffe7206f0d02aa85e488b689fc0288084ea51b259cf49cd40f53c19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67IT73LWLKMC7UBWLJDWF5Y3UU/bundle.json","state_url":"https://pith.science/pith/67IT73LWLKMC7UBWLJDWF5Y3UU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67IT73LWLKMC7UBWLJDWF5Y3UU/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-02T19:27:42Z","links":{"resolver":"https://pith.science/pith/67IT73LWLKMC7UBWLJDWF5Y3UU","bundle":"https://pith.science/pith/67IT73LWLKMC7UBWLJDWF5Y3UU/bundle.json","state":"https://pith.science/pith/67IT73LWLKMC7UBWLJDWF5Y3UU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67IT73LWLKMC7UBWLJDWF5Y3UU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:67IT73LWLKMC7UBWLJDWF5Y3UU","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":"53c25d2921f19018b7547bc7e55ce74789aa50a5051f299e87fcfc8a4d6c4da7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T19:22:36Z","title_canon_sha256":"c88d969061d14959a4ac73606c0b85a4d05cbec83fb529a6ea852097c848f35e"},"schema_version":"1.0","source":{"id":"2606.00290","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00290","created_at":"2026-06-02T01:03:50Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00290v1","created_at":"2026-06-02T01:03:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00290","created_at":"2026-06-02T01:03:50Z"},{"alias_kind":"pith_short_12","alias_value":"67IT73LWLKMC","created_at":"2026-06-02T01:03:50Z"},{"alias_kind":"pith_short_16","alias_value":"67IT73LWLKMC7UBW","created_at":"2026-06-02T01:03:50Z"},{"alias_kind":"pith_short_8","alias_value":"67IT73LW","created_at":"2026-06-02T01:03:50Z"}],"graph_snapshots":[{"event_id":"sha256:0f61d90a4ffe7206f0d02aa85e488b689fc0288084ea51b259cf49cd40f53c19","target":"graph","created_at":"2026-06-02T01:03:50Z","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/2606.00290/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The inducibility constant $\\lambda_{F}$ of a graph $F$ is the asymptotically maximum induced density of $F$ in a growing sequence of graphs. This paper systematically investigates the case when $F$ has 6 vertices (and there are 78 cases to consider up to isomorphism and complementation). We show that flag algebras can compute the sharp upper bound on $\\lambda_F$ in 36 cases of which, as far as the authors know, 30 are new results. In each of the solved cases, we also prove results about the structure of large (almost) extremal graphs. In particular, we establish perfect stability in all 32 cas","authors_text":"Jared Le\\'on, Jun Gao, Levente Bodn\\'ar, Oleg Pikhurko, Shumin Sun, Xizhi Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T19:22:36Z","title":"The inducibility of 6-vertex graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00290","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:a8b9a3110693c496e353eb9bfec37d4e4637f1c5b0ee364ac30b28dc13d780e7","target":"record","created_at":"2026-06-02T01:03:50Z","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":"53c25d2921f19018b7547bc7e55ce74789aa50a5051f299e87fcfc8a4d6c4da7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-29T19:22:36Z","title_canon_sha256":"c88d969061d14959a4ac73606c0b85a4d05cbec83fb529a6ea852097c848f35e"},"schema_version":"1.0","source":{"id":"2606.00290","kind":"arxiv","version":1}},"canonical_sha256":"f7d13fed765a982fd0365a4762f71ba51e986819f433d445a14821c02d78e922","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7d13fed765a982fd0365a4762f71ba51e986819f433d445a14821c02d78e922","first_computed_at":"2026-06-02T01:03:50.806811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:50.806811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lHzmvmh8fTRX66kGKMtrLAERMfXVgl8ZgAGJbrJ6nD0WCntFTNItpuMbkZKZjWrWxIpHBOvUO0/uMdGQUo2iCQ==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:50.807224Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00290","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8b9a3110693c496e353eb9bfec37d4e4637f1c5b0ee364ac30b28dc13d780e7","sha256:0f61d90a4ffe7206f0d02aa85e488b689fc0288084ea51b259cf49cd40f53c19"],"state_sha256":"a561a5df85e70190f0aad64477ddd0efbdc1ceb5edb282641843248429b25d41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"alJY2QR+lTQrnhbf2Q5xy6f+cWpJPInY/XZhdu/V5Ofm6AA5OXkq5uXpyh4+IzNt1X+wjviWS49WEkqdaUEHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:27:42.300885Z","bundle_sha256":"3a10a2e6e241fcadccb4b2e85ddea3d6606d2aff93d5b876c5a0e1941479c0bf"}}