{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HHAS23VT3E632J4M5ACGJVD24S","short_pith_number":"pith:HHAS23VT","schema_version":"1.0","canonical_sha256":"39c12d6eb3d93dbd278ce80464d47ae4ade0632d544f793153507418d0aec6bc","source":{"kind":"arxiv","id":"2501.09842","version":2},"attestation_state":"computed","paper":{"title":"The semi-inducibility problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdul Basit, Andr\\'e K\\\"undgen, Bertille Granet, Daniel Horsley, Katherine Staden","submitted_at":"2025-01-16T21:08:35Z","abstract_excerpt":"Let $H$ be a $k$-edge-coloured graph and let $n$ be a positive integer. What is the maximum number of copies of $H$ in a $k$-edge-coloured complete graph on $n$ vertices? This paper studies the case $k=2$, which we call the semi-inducibility problem. This problem is a generalisation of the inducibility problem of Pippenger and Golumbic which is solved only for some small graphs and limited families of graphs. We prove sharp or almost sharp results for alternating walks, for alternating cycles of length divisible by 4, and for 4-cycles of every colour pattern.\n  Liu, Mubayi and Reiher asked whe"},"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":"2501.09842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-16T21:08:35Z","cross_cats_sorted":[],"title_canon_sha256":"5aaa70a21ec3643d2f08cff7ccee82afcd5d48aa5395ba217031131d6a98cbe6","abstract_canon_sha256":"0adf2deb8cf1bea2fd072cfd0d6aef42c222d7da804d37155ac33a09d9514aee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:31.299722Z","signature_b64":"9Z+PAn8XI8SgIfM7KZpDs9SmgGaRt/BgOLmCIqtNIFMtVpwjXKjHBRpxVAA0P4dmMw9/w2syZ4t/fQ4tasyuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39c12d6eb3d93dbd278ce80464d47ae4ade0632d544f793153507418d0aec6bc","last_reissued_at":"2026-07-05T10:51:31.299214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:31.299214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The semi-inducibility problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdul Basit, Andr\\'e K\\\"undgen, Bertille Granet, Daniel Horsley, Katherine Staden","submitted_at":"2025-01-16T21:08:35Z","abstract_excerpt":"Let $H$ be a $k$-edge-coloured graph and let $n$ be a positive integer. What is the maximum number of copies of $H$ in a $k$-edge-coloured complete graph on $n$ vertices? This paper studies the case $k=2$, which we call the semi-inducibility problem. This problem is a generalisation of the inducibility problem of Pippenger and Golumbic which is solved only for some small graphs and limited families of graphs. We prove sharp or almost sharp results for alternating walks, for alternating cycles of length divisible by 4, and for 4-cycles of every colour pattern.\n  Liu, Mubayi and Reiher asked whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.09842","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/2501.09842/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":"2501.09842","created_at":"2026-07-05T10:51:31.299263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.09842v2","created_at":"2026-07-05T10:51:31.299263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.09842","created_at":"2026-07-05T10:51:31.299263+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHAS23VT3E63","created_at":"2026-07-05T10:51:31.299263+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHAS23VT3E632J4M","created_at":"2026-07-05T10:51:31.299263+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHAS23VT","created_at":"2026-07-05T10:51:31.299263+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23351","citing_title":"Fixed-density profiles for the semi-induced 4-vertex star","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14138","citing_title":"On Tournament Anti-Sidorenko Orientations of Trees","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HHAS23VT3E632J4M5ACGJVD24S","json":"https://pith.science/pith/HHAS23VT3E632J4M5ACGJVD24S.json","graph_json":"https://pith.science/api/pith-number/HHAS23VT3E632J4M5ACGJVD24S/graph.json","events_json":"https://pith.science/api/pith-number/HHAS23VT3E632J4M5ACGJVD24S/events.json","paper":"https://pith.science/paper/HHAS23VT"},"agent_actions":{"view_html":"https://pith.science/pith/HHAS23VT3E632J4M5ACGJVD24S","download_json":"https://pith.science/pith/HHAS23VT3E632J4M5ACGJVD24S.json","view_paper":"https://pith.science/paper/HHAS23VT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.09842&json=true","fetch_graph":"https://pith.science/api/pith-number/HHAS23VT3E632J4M5ACGJVD24S/graph.json","fetch_events":"https://pith.science/api/pith-number/HHAS23VT3E632J4M5ACGJVD24S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHAS23VT3E632J4M5ACGJVD24S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHAS23VT3E632J4M5ACGJVD24S/action/storage_attestation","attest_author":"https://pith.science/pith/HHAS23VT3E632J4M5ACGJVD24S/action/author_attestation","sign_citation":"https://pith.science/pith/HHAS23VT3E632J4M5ACGJVD24S/action/citation_signature","submit_replication":"https://pith.science/pith/HHAS23VT3E632J4M5ACGJVD24S/action/replication_record"}},"created_at":"2026-07-05T10:51:31.299263+00:00","updated_at":"2026-07-05T10:51:31.299263+00:00"}