{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5KIURFGOAXHQHA3ZTYY2VYKQLK","short_pith_number":"pith:5KIURFGO","schema_version":"1.0","canonical_sha256":"ea914894ce05cf0383799e31aae1505ab4d77e058cded09ab70f075d24e16de3","source":{"kind":"arxiv","id":"2510.24336","version":2},"attestation_state":"computed","paper":{"title":"Semi-inducibility of 4-vertex graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Levente Bodn\\'ar, Oleg Pikhurko","submitted_at":"2025-10-28T11:57:53Z","abstract_excerpt":"For a graph $H$ whose edges are coloured blue or red, the $H$-semi-inducibility problem asks for the maximum, over all graphs $G$ of given order $n$, of the number of injections from the vertex set of $H$ into the vertex set of $G$ that send red (resp. blue) edges of $H$ to edges (resp. non-edges) of $G$. We consider all possible 4-vertex non-complete graphs $H$ and essentially resolve all remaining cases except when $H$ is the 3-edge path coloured blue-blue-red in this order (or is equivalent to this case). Some of our proofs are computer-generated, using the flag algebra method of Razborov."},"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":"2510.24336","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-10-28T11:57:53Z","cross_cats_sorted":[],"title_canon_sha256":"8e0056dc25e88cc5b988edeed60e0e796ec673cbc7421e7f628d11caca9394ef","abstract_canon_sha256":"d68f7475168d4d1e43befed564f11bf6dce19ecd512943485506929332d47120"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:32.085685Z","signature_b64":"N29K+nro8pzi0YEa7e7ECSah21V0n9kfg2S3Yw3UQWUHGxCkRv5o6aU4A9K+8A2CBnCEhbfa17te6X8wiFR2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea914894ce05cf0383799e31aae1505ab4d77e058cded09ab70f075d24e16de3","last_reissued_at":"2026-05-28T01:04:32.085152Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:32.085152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-inducibility of 4-vertex graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Levente Bodn\\'ar, Oleg Pikhurko","submitted_at":"2025-10-28T11:57:53Z","abstract_excerpt":"For a graph $H$ whose edges are coloured blue or red, the $H$-semi-inducibility problem asks for the maximum, over all graphs $G$ of given order $n$, of the number of injections from the vertex set of $H$ into the vertex set of $G$ that send red (resp. blue) edges of $H$ to edges (resp. non-edges) of $G$. We consider all possible 4-vertex non-complete graphs $H$ and essentially resolve all remaining cases except when $H$ is the 3-edge path coloured blue-blue-red in this order (or is equivalent to this case). Some of our proofs are computer-generated, using the flag algebra method of Razborov."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.24336","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.24336/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":"2510.24336","created_at":"2026-05-28T01:04:32.085215+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.24336v2","created_at":"2026-05-28T01:04:32.085215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.24336","created_at":"2026-05-28T01:04:32.085215+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KIURFGOAXHQ","created_at":"2026-05-28T01:04:32.085215+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KIURFGOAXHQHA3Z","created_at":"2026-05-28T01:04:32.085215+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KIURFGO","created_at":"2026-05-28T01:04:32.085215+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/5KIURFGOAXHQHA3ZTYY2VYKQLK","json":"https://pith.science/pith/5KIURFGOAXHQHA3ZTYY2VYKQLK.json","graph_json":"https://pith.science/api/pith-number/5KIURFGOAXHQHA3ZTYY2VYKQLK/graph.json","events_json":"https://pith.science/api/pith-number/5KIURFGOAXHQHA3ZTYY2VYKQLK/events.json","paper":"https://pith.science/paper/5KIURFGO"},"agent_actions":{"view_html":"https://pith.science/pith/5KIURFGOAXHQHA3ZTYY2VYKQLK","download_json":"https://pith.science/pith/5KIURFGOAXHQHA3ZTYY2VYKQLK.json","view_paper":"https://pith.science/paper/5KIURFGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.24336&json=true","fetch_graph":"https://pith.science/api/pith-number/5KIURFGOAXHQHA3ZTYY2VYKQLK/graph.json","fetch_events":"https://pith.science/api/pith-number/5KIURFGOAXHQHA3ZTYY2VYKQLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KIURFGOAXHQHA3ZTYY2VYKQLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KIURFGOAXHQHA3ZTYY2VYKQLK/action/storage_attestation","attest_author":"https://pith.science/pith/5KIURFGOAXHQHA3ZTYY2VYKQLK/action/author_attestation","sign_citation":"https://pith.science/pith/5KIURFGOAXHQHA3ZTYY2VYKQLK/action/citation_signature","submit_replication":"https://pith.science/pith/5KIURFGOAXHQHA3ZTYY2VYKQLK/action/replication_record"}},"created_at":"2026-05-28T01:04:32.085215+00:00","updated_at":"2026-05-28T01:04:32.085215+00:00"}