{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TPFVSRWW3DJGEOJ4A4T3ILY7LC","short_pith_number":"pith:TPFVSRWW","schema_version":"1.0","canonical_sha256":"9bcb5946d6d8d262393c0727b42f1f588ff69623669988f4d199dc163a99e90d","source":{"kind":"arxiv","id":"2206.10058","version":1},"attestation_state":"computed","paper":{"title":"Non-trivial squares and Sidorenko's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amanda Redlich, Annie Raymond, Pranav Garg","submitted_at":"2022-06-21T00:45:01Z","abstract_excerpt":"Let $t(H;G)$ be the homomorphism density of a graph $H$ into a graph $G$. Sidorenko's conjecture states that for any bipartite graph $H$, $t(H;G)\\geq t(K_2;G)^{|E(H)|}$ for all graphs $G$. It is already known that such inequalities cannot be certified through the sums of squares method when $H$ is a so-called trivial square. In this paper, we investigate recent results about Sidorenko's conjecture and classify those involving trivial versus non-trivial squares. We then present some computational results. In particular, we categorize the bipartite graphs $H$ on at most 7 edges for which $t(H;G)"},"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":"2206.10058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-21T00:45:01Z","cross_cats_sorted":[],"title_canon_sha256":"0e80ba1f726fdea9fe5674cb88621e53aca76fa6997ff3af9a347ff2b47d64ce","abstract_canon_sha256":"cc3440649a31a90d2c6d217919b533162e4673280b8425090f4b810df0ab41b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:33:43.025326Z","signature_b64":"PGzidqWstD9BkN9vkvaeGafyvsz67lH6mGnpA4hoV9t2Poc6IzeRpgWyq1dOwKGuXLqY5AohVYq/iFBA0XeJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bcb5946d6d8d262393c0727b42f1f588ff69623669988f4d199dc163a99e90d","last_reissued_at":"2026-07-05T04:33:43.024726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:33:43.024726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-trivial squares and Sidorenko's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amanda Redlich, Annie Raymond, Pranav Garg","submitted_at":"2022-06-21T00:45:01Z","abstract_excerpt":"Let $t(H;G)$ be the homomorphism density of a graph $H$ into a graph $G$. Sidorenko's conjecture states that for any bipartite graph $H$, $t(H;G)\\geq t(K_2;G)^{|E(H)|}$ for all graphs $G$. It is already known that such inequalities cannot be certified through the sums of squares method when $H$ is a so-called trivial square. In this paper, we investigate recent results about Sidorenko's conjecture and classify those involving trivial versus non-trivial squares. We then present some computational results. In particular, we categorize the bipartite graphs $H$ on at most 7 edges for which $t(H;G)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.10058","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/2206.10058/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":"2206.10058","created_at":"2026-07-05T04:33:43.024850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.10058v1","created_at":"2026-07-05T04:33:43.024850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.10058","created_at":"2026-07-05T04:33:43.024850+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPFVSRWW3DJG","created_at":"2026-07-05T04:33:43.024850+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPFVSRWW3DJGEOJ4","created_at":"2026-07-05T04:33:43.024850+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPFVSRWW","created_at":"2026-07-05T04:33:43.024850+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.12904","citing_title":"Forcing Graphs to be Forcing","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPFVSRWW3DJGEOJ4A4T3ILY7LC","json":"https://pith.science/pith/TPFVSRWW3DJGEOJ4A4T3ILY7LC.json","graph_json":"https://pith.science/api/pith-number/TPFVSRWW3DJGEOJ4A4T3ILY7LC/graph.json","events_json":"https://pith.science/api/pith-number/TPFVSRWW3DJGEOJ4A4T3ILY7LC/events.json","paper":"https://pith.science/paper/TPFVSRWW"},"agent_actions":{"view_html":"https://pith.science/pith/TPFVSRWW3DJGEOJ4A4T3ILY7LC","download_json":"https://pith.science/pith/TPFVSRWW3DJGEOJ4A4T3ILY7LC.json","view_paper":"https://pith.science/paper/TPFVSRWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.10058&json=true","fetch_graph":"https://pith.science/api/pith-number/TPFVSRWW3DJGEOJ4A4T3ILY7LC/graph.json","fetch_events":"https://pith.science/api/pith-number/TPFVSRWW3DJGEOJ4A4T3ILY7LC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPFVSRWW3DJGEOJ4A4T3ILY7LC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPFVSRWW3DJGEOJ4A4T3ILY7LC/action/storage_attestation","attest_author":"https://pith.science/pith/TPFVSRWW3DJGEOJ4A4T3ILY7LC/action/author_attestation","sign_citation":"https://pith.science/pith/TPFVSRWW3DJGEOJ4A4T3ILY7LC/action/citation_signature","submit_replication":"https://pith.science/pith/TPFVSRWW3DJGEOJ4A4T3ILY7LC/action/replication_record"}},"created_at":"2026-07-05T04:33:43.024850+00:00","updated_at":"2026-07-05T04:33:43.024850+00:00"}