{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PC5USJHENYLL564PD5UYEQKJWT","short_pith_number":"pith:PC5USJHE","schema_version":"1.0","canonical_sha256":"78bb4924e46e16befb8f1f69824149b4d705037ff5c374ab0601b53fb6c945b8","source":{"kind":"arxiv","id":"2412.12904","version":1},"attestation_state":"computed","paper":{"title":"Forcing Graphs to be Forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aldo Kiem, Christoph Spiegel, Olaf Parczyk","submitted_at":"2024-12-17T13:28:49Z","abstract_excerpt":"Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any minimizer in fact needs to be quasi-random. Here we extend the family of bipartite graphs for which the forcing conjecture is known to hold to include balanced blow-ups of Sidorenko graphs and subdivisions of Sidorenko graphs by a forcing graph. This partially generalizes results by Conlon et al. (2018) and Conlon and Lee (2021). We also show that the box product o"},"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":"2412.12904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T13:28:49Z","cross_cats_sorted":[],"title_canon_sha256":"705843ec1363cac23f48165959888a9aba8f94363b7cc9bc01b847a3acd4b772","abstract_canon_sha256":"dd878785c5082c8bfdaf36a7e70e49e7d571ab91a3a9965db306936dea7cb076"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:22.452111Z","signature_b64":"ckFU1aBzKa3AHmXxmnlkf1VpGVpIbOeh7poRBxTtpzKOyr2QVke7zrLQFb2S7ahD4ENrHx1Fmbsa9GLJacPRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78bb4924e46e16befb8f1f69824149b4d705037ff5c374ab0601b53fb6c945b8","last_reissued_at":"2026-07-05T09:50:22.451712Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:22.451712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forcing Graphs to be Forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aldo Kiem, Christoph Spiegel, Olaf Parczyk","submitted_at":"2024-12-17T13:28:49Z","abstract_excerpt":"Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any minimizer in fact needs to be quasi-random. Here we extend the family of bipartite graphs for which the forcing conjecture is known to hold to include balanced blow-ups of Sidorenko graphs and subdivisions of Sidorenko graphs by a forcing graph. This partially generalizes results by Conlon et al. (2018) and Conlon and Lee (2021). We also show that the box product o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12904","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/2412.12904/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":"2412.12904","created_at":"2026-07-05T09:50:22.451769+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.12904v1","created_at":"2026-07-05T09:50:22.451769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12904","created_at":"2026-07-05T09:50:22.451769+00:00"},{"alias_kind":"pith_short_12","alias_value":"PC5USJHENYLL","created_at":"2026-07-05T09:50:22.451769+00:00"},{"alias_kind":"pith_short_16","alias_value":"PC5USJHENYLL564P","created_at":"2026-07-05T09:50:22.451769+00:00"},{"alias_kind":"pith_short_8","alias_value":"PC5USJHE","created_at":"2026-07-05T09:50:22.451769+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30010","citing_title":"$L^p$-form of the KNRS conjecture","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PC5USJHENYLL564PD5UYEQKJWT","json":"https://pith.science/pith/PC5USJHENYLL564PD5UYEQKJWT.json","graph_json":"https://pith.science/api/pith-number/PC5USJHENYLL564PD5UYEQKJWT/graph.json","events_json":"https://pith.science/api/pith-number/PC5USJHENYLL564PD5UYEQKJWT/events.json","paper":"https://pith.science/paper/PC5USJHE"},"agent_actions":{"view_html":"https://pith.science/pith/PC5USJHENYLL564PD5UYEQKJWT","download_json":"https://pith.science/pith/PC5USJHENYLL564PD5UYEQKJWT.json","view_paper":"https://pith.science/paper/PC5USJHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.12904&json=true","fetch_graph":"https://pith.science/api/pith-number/PC5USJHENYLL564PD5UYEQKJWT/graph.json","fetch_events":"https://pith.science/api/pith-number/PC5USJHENYLL564PD5UYEQKJWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PC5USJHENYLL564PD5UYEQKJWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PC5USJHENYLL564PD5UYEQKJWT/action/storage_attestation","attest_author":"https://pith.science/pith/PC5USJHENYLL564PD5UYEQKJWT/action/author_attestation","sign_citation":"https://pith.science/pith/PC5USJHENYLL564PD5UYEQKJWT/action/citation_signature","submit_replication":"https://pith.science/pith/PC5USJHENYLL564PD5UYEQKJWT/action/replication_record"}},"created_at":"2026-07-05T09:50:22.451769+00:00","updated_at":"2026-07-05T09:50:22.451769+00:00"}