{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FUUMMAC47TBUHCSDZLVUJ2PAGK","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":"2d6f07fcfaaf9bf880d5fd05631d212bdc032615b873e535c545ef472528a058","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T09:25:06Z","title_canon_sha256":"0a169443ca5e4e042724ed84504e89e2252a5e5ffa4f7bab76cf6773c11fe559"},"schema_version":"1.0","source":{"id":"2607.27911","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27911","created_at":"2026-07-31T01:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27911v1","created_at":"2026-07-31T01:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27911","created_at":"2026-07-31T01:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"FUUMMAC47TBU","created_at":"2026-07-31T01:34:46Z"},{"alias_kind":"pith_short_16","alias_value":"FUUMMAC47TBUHCSD","created_at":"2026-07-31T01:34:46Z"},{"alias_kind":"pith_short_8","alias_value":"FUUMMAC4","created_at":"2026-07-31T01:34:46Z"}],"graph_snapshots":[{"event_id":"sha256:54b76bebd0da4f2b96d50be15f6b25865a6f0841d7424cbe6cfa79d1bb890930","target":"graph","created_at":"2026-07-31T01:34: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/2607.27911/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For an $n$-vertex graph $G$, let $N(H_3,G)$ be the number of injective labeled copies of the red-blue path $H_3$ for which the two blue pairs are mapped to non-edges of $G$ and the red pair is mapped to an edge of $G$. We determine the maximum limiting value of $N(H_3,G)/n^4$ and give an extremal construction, which is the disjoint union of a clique and an asymptotically regular graph. The proof uses weighted vertex quotients and degree-square tie-breaking. We thereby resolve the exceptional four-vertex case left open in the recent classification of non-complete red-blue graphs.","authors_text":"Jinghua Deng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T09:25:06Z","title":"The semi-inducibility of the blue--blue--red path on four vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27911","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:453bdda7a140b9be624f4bcd83d6c0530f1df61a58449e5179d0a6cad7547d2c","target":"record","created_at":"2026-07-31T01:34: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":"2d6f07fcfaaf9bf880d5fd05631d212bdc032615b873e535c545ef472528a058","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T09:25:06Z","title_canon_sha256":"0a169443ca5e4e042724ed84504e89e2252a5e5ffa4f7bab76cf6773c11fe559"},"schema_version":"1.0","source":{"id":"2607.27911","kind":"arxiv","version":1}},"canonical_sha256":"2d28c6005cfcc3438a43caeb44e9e032b73343b4ab87ef62f9308ba1f4c1a45a","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d28c6005cfcc3438a43caeb44e9e032b73343b4ab87ef62f9308ba1f4c1a45a","first_computed_at":"2026-07-31T01:34:46.855973Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:34:46.855973Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27911","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:453bdda7a140b9be624f4bcd83d6c0530f1df61a58449e5179d0a6cad7547d2c","sha256:54b76bebd0da4f2b96d50be15f6b25865a6f0841d7424cbe6cfa79d1bb890930"],"state_sha256":"6361a2d0c0d599b4fd23b66e73c14f5524cfe379f577146ee3d718c474cf82fe"}