{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FUUMMAC47TBUHCSDZLVUJ2PAGK","short_pith_number":"pith:FUUMMAC4","schema_version":"1.0","canonical_sha256":"2d28c6005cfcc3438a43caeb44e9e032b73343b4ab87ef62f9308ba1f4c1a45a","source":{"kind":"arxiv","id":"2607.27911","version":1},"attestation_state":"computed","paper":{"title":"The semi-inducibility of the blue--blue--red path on four vertices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jinghua Deng","submitted_at":"2026-07-30T09:25:06Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.27911","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T09:25:06Z","cross_cats_sorted":[],"title_canon_sha256":"0a169443ca5e4e042724ed84504e89e2252a5e5ffa4f7bab76cf6773c11fe559","abstract_canon_sha256":"2d6f07fcfaaf9bf880d5fd05631d212bdc032615b873e535c545ef472528a058"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d28c6005cfcc3438a43caeb44e9e032b73343b4ab87ef62f9308ba1f4c1a45a","last_reissued_at":"2026-07-31T01:34:46.855973Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:34:46.855973Z"},"graph_snapshot":{"paper":{"title":"The semi-inducibility of the blue--blue--red path on four vertices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jinghua Deng","submitted_at":"2026-07-30T09:25:06Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27911","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/2607.27911/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.27911","created_at":"2026-07-31T01:34:46.859059+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.27911v1","created_at":"2026-07-31T01:34:46.859059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27911","created_at":"2026-07-31T01:34:46.859059+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUUMMAC47TBU","created_at":"2026-07-31T01:34:46.859059+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUUMMAC47TBUHCSD","created_at":"2026-07-31T01:34:46.859059+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUUMMAC4","created_at":"2026-07-31T01:34:46.859059+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FUUMMAC47TBUHCSDZLVUJ2PAGK","json":"https://pith.science/pith/FUUMMAC47TBUHCSDZLVUJ2PAGK.json","graph_json":"https://pith.science/api/pith-number/FUUMMAC47TBUHCSDZLVUJ2PAGK/graph.json","events_json":"https://pith.science/api/pith-number/FUUMMAC47TBUHCSDZLVUJ2PAGK/events.json","paper":"https://pith.science/paper/FUUMMAC4"},"agent_actions":{"view_html":"https://pith.science/pith/FUUMMAC47TBUHCSDZLVUJ2PAGK","download_json":"https://pith.science/pith/FUUMMAC47TBUHCSDZLVUJ2PAGK.json","view_paper":"https://pith.science/paper/FUUMMAC4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.27911&json=true","fetch_graph":"https://pith.science/api/pith-number/FUUMMAC47TBUHCSDZLVUJ2PAGK/graph.json","fetch_events":"https://pith.science/api/pith-number/FUUMMAC47TBUHCSDZLVUJ2PAGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUUMMAC47TBUHCSDZLVUJ2PAGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUUMMAC47TBUHCSDZLVUJ2PAGK/action/storage_attestation","attest_author":"https://pith.science/pith/FUUMMAC47TBUHCSDZLVUJ2PAGK/action/author_attestation","sign_citation":"https://pith.science/pith/FUUMMAC47TBUHCSDZLVUJ2PAGK/action/citation_signature","submit_replication":"https://pith.science/pith/FUUMMAC47TBUHCSDZLVUJ2PAGK/action/replication_record"}},"created_at":"2026-07-31T01:34:46.859059+00:00","updated_at":"2026-07-31T01:34:46.859059+00:00"}