{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BYGRXTGGQYDYPBQ4HUQTKBARIM","short_pith_number":"pith:BYGRXTGG","schema_version":"1.0","canonical_sha256":"0e0d1bccc6860787861c3d213504114301690d3eae72948d75168be9ff215b06","source":{"kind":"arxiv","id":"2103.07047","version":2},"attestation_state":"computed","paper":{"title":"Inducibility of 4-vertex tournaments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Dalton Burke, Florian Pfender, Michael Phillips","submitted_at":"2021-03-12T02:41:44Z","abstract_excerpt":"We determine the inducibility of all tournaments with at most $4$ vertices together with the extremal constructions. The $4$-vertex tournament containing an oriented $C_3$ and one source vertex has a particularly interesting extremal construction. It is an unbalanced blow-up of an edge, where the sink vertex is replaced by a quasi-random tournament and the source vertex is iteratively replaced by a copy of the construction itself."},"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":"2103.07047","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-03-12T02:41:44Z","cross_cats_sorted":[],"title_canon_sha256":"92eef76676df870c73b270cafdf29045be7291b564d112872deb5789dd368602","abstract_canon_sha256":"4df61fce48fcc9a77f27b1b10489bbb159264a4834cabeb0170fa09a32a37523"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:27:09.009275Z","signature_b64":"YaTSeGITfb0kr5sy5ij6UzS/0ThPbu3yj/z2CpNdqk7IMVoYizzD/V9pwrgfjLv761wZmk5bLbQsoP3bFyQ6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e0d1bccc6860787861c3d213504114301690d3eae72948d75168be9ff215b06","last_reissued_at":"2026-07-05T05:27:09.008864Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:27:09.008864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inducibility of 4-vertex tournaments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Dalton Burke, Florian Pfender, Michael Phillips","submitted_at":"2021-03-12T02:41:44Z","abstract_excerpt":"We determine the inducibility of all tournaments with at most $4$ vertices together with the extremal constructions. The $4$-vertex tournament containing an oriented $C_3$ and one source vertex has a particularly interesting extremal construction. It is an unbalanced blow-up of an edge, where the sink vertex is replaced by a quasi-random tournament and the source vertex is iteratively replaced by a copy of the construction itself."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.07047","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/2103.07047/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":"2103.07047","created_at":"2026-07-05T05:27:09.008919+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.07047v2","created_at":"2026-07-05T05:27:09.008919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.07047","created_at":"2026-07-05T05:27:09.008919+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYGRXTGGQYDY","created_at":"2026-07-05T05:27:09.008919+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYGRXTGGQYDYPBQ4","created_at":"2026-07-05T05:27:09.008919+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYGRXTGG","created_at":"2026-07-05T05:27:09.008919+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05346","citing_title":"Balanced bipartite distance of $K_4$-free graphs","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYGRXTGGQYDYPBQ4HUQTKBARIM","json":"https://pith.science/pith/BYGRXTGGQYDYPBQ4HUQTKBARIM.json","graph_json":"https://pith.science/api/pith-number/BYGRXTGGQYDYPBQ4HUQTKBARIM/graph.json","events_json":"https://pith.science/api/pith-number/BYGRXTGGQYDYPBQ4HUQTKBARIM/events.json","paper":"https://pith.science/paper/BYGRXTGG"},"agent_actions":{"view_html":"https://pith.science/pith/BYGRXTGGQYDYPBQ4HUQTKBARIM","download_json":"https://pith.science/pith/BYGRXTGGQYDYPBQ4HUQTKBARIM.json","view_paper":"https://pith.science/paper/BYGRXTGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.07047&json=true","fetch_graph":"https://pith.science/api/pith-number/BYGRXTGGQYDYPBQ4HUQTKBARIM/graph.json","fetch_events":"https://pith.science/api/pith-number/BYGRXTGGQYDYPBQ4HUQTKBARIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYGRXTGGQYDYPBQ4HUQTKBARIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYGRXTGGQYDYPBQ4HUQTKBARIM/action/storage_attestation","attest_author":"https://pith.science/pith/BYGRXTGGQYDYPBQ4HUQTKBARIM/action/author_attestation","sign_citation":"https://pith.science/pith/BYGRXTGGQYDYPBQ4HUQTKBARIM/action/citation_signature","submit_replication":"https://pith.science/pith/BYGRXTGGQYDYPBQ4HUQTKBARIM/action/replication_record"}},"created_at":"2026-07-05T05:27:09.008919+00:00","updated_at":"2026-07-05T05:27:09.008919+00:00"}