{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VXMBMKOLT5YNVUS2NJETRONVCT","short_pith_number":"pith:VXMBMKOL","schema_version":"1.0","canonical_sha256":"add81629cb9f70dad25a6a4938b9b514c6bfa9c7be6066a83aac734d477f9232","source":{"kind":"arxiv","id":"2305.16542","version":2},"attestation_state":"computed","paper":{"title":"Sidorenko-Type Inequalities for Pairs of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gabriel Crudele, Jonathan A. Noel, Lina M. Simbaqueba, Natalie Behague","submitted_at":"2023-05-25T23:50:33Z","abstract_excerpt":"Given two non-empty graphs $H$ and $T$, write $H\\succcurlyeq T$ to mean that $t(H,G)^{|E(T)|}\\geq t(T,G)^{|E(H)|}$ for every graph $G$, where $t(\\cdot,\\cdot)$ is the homomorphism density function. We obtain various necessary and sufficient conditions for two trees $H$ and $T$ to satisfy $H\\succcurlyeq T$ and determine all such pairs on at most 8 vertices. This extends results of Leontovich and Sidorenko from the 1980s and 90s. Our approach applies an information-theoretic technique to reduce the problem of showing that $H\\succcurlyeq T$ for two forests $H$ and $T$ to solving a linear program 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":"2305.16542","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-25T23:50:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8602d02b2a5317926234ea8fac61238cf3fec36b3390e90176010b979a208835","abstract_canon_sha256":"bcfab5ff7dd1e6953fbe5ecf5dcf7cbec94fce92eb6c35897d186d67f4e4139d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:37.334959Z","signature_b64":"/NCEr1PpUUIrzBkuh0BjR+q/8u2mEiIPTjZpo/UuGbxoaoiElC27xcHdhRGSpmKWl3HEwOLCZHTXWcFm5kh9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"add81629cb9f70dad25a6a4938b9b514c6bfa9c7be6066a83aac734d477f9232","last_reissued_at":"2026-07-05T09:57:37.334497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:37.334497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sidorenko-Type Inequalities for Pairs of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gabriel Crudele, Jonathan A. Noel, Lina M. Simbaqueba, Natalie Behague","submitted_at":"2023-05-25T23:50:33Z","abstract_excerpt":"Given two non-empty graphs $H$ and $T$, write $H\\succcurlyeq T$ to mean that $t(H,G)^{|E(T)|}\\geq t(T,G)^{|E(H)|}$ for every graph $G$, where $t(\\cdot,\\cdot)$ is the homomorphism density function. We obtain various necessary and sufficient conditions for two trees $H$ and $T$ to satisfy $H\\succcurlyeq T$ and determine all such pairs on at most 8 vertices. This extends results of Leontovich and Sidorenko from the 1980s and 90s. Our approach applies an information-theoretic technique to reduce the problem of showing that $H\\succcurlyeq T$ for two forests $H$ and $T$ to solving a linear program o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16542","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/2305.16542/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":"2305.16542","created_at":"2026-07-05T09:57:37.334553+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.16542v2","created_at":"2026-07-05T09:57:37.334553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16542","created_at":"2026-07-05T09:57:37.334553+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXMBMKOLT5YN","created_at":"2026-07-05T09:57:37.334553+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXMBMKOLT5YNVUS2","created_at":"2026-07-05T09:57:37.334553+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXMBMKOL","created_at":"2026-07-05T09:57:37.334553+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.03903","citing_title":"Maximizing Alternating Paths via Entropy","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VXMBMKOLT5YNVUS2NJETRONVCT","json":"https://pith.science/pith/VXMBMKOLT5YNVUS2NJETRONVCT.json","graph_json":"https://pith.science/api/pith-number/VXMBMKOLT5YNVUS2NJETRONVCT/graph.json","events_json":"https://pith.science/api/pith-number/VXMBMKOLT5YNVUS2NJETRONVCT/events.json","paper":"https://pith.science/paper/VXMBMKOL"},"agent_actions":{"view_html":"https://pith.science/pith/VXMBMKOLT5YNVUS2NJETRONVCT","download_json":"https://pith.science/pith/VXMBMKOLT5YNVUS2NJETRONVCT.json","view_paper":"https://pith.science/paper/VXMBMKOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.16542&json=true","fetch_graph":"https://pith.science/api/pith-number/VXMBMKOLT5YNVUS2NJETRONVCT/graph.json","fetch_events":"https://pith.science/api/pith-number/VXMBMKOLT5YNVUS2NJETRONVCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXMBMKOLT5YNVUS2NJETRONVCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXMBMKOLT5YNVUS2NJETRONVCT/action/storage_attestation","attest_author":"https://pith.science/pith/VXMBMKOLT5YNVUS2NJETRONVCT/action/author_attestation","sign_citation":"https://pith.science/pith/VXMBMKOLT5YNVUS2NJETRONVCT/action/citation_signature","submit_replication":"https://pith.science/pith/VXMBMKOLT5YNVUS2NJETRONVCT/action/replication_record"}},"created_at":"2026-07-05T09:57:37.334553+00:00","updated_at":"2026-07-05T09:57:37.334553+00:00"}