{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VXMBMKOLT5YNVUS2NJETRONVCT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bcfab5ff7dd1e6953fbe5ecf5dcf7cbec94fce92eb6c35897d186d67f4e4139d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-25T23:50:33Z","title_canon_sha256":"8602d02b2a5317926234ea8fac61238cf3fec36b3390e90176010b979a208835"},"schema_version":"1.0","source":{"id":"2305.16542","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.16542","created_at":"2026-07-05T09:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"2305.16542v2","created_at":"2026-07-05T09:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16542","created_at":"2026-07-05T09:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"VXMBMKOLT5YN","created_at":"2026-07-05T09:57:37Z"},{"alias_kind":"pith_short_16","alias_value":"VXMBMKOLT5YNVUS2","created_at":"2026-07-05T09:57:37Z"},{"alias_kind":"pith_short_8","alias_value":"VXMBMKOL","created_at":"2026-07-05T09:57:37Z"}],"graph_snapshots":[{"event_id":"sha256:7d7ea3476db671e194aa2e7624222c62e0f688b4c6963dd73b34abf18a21e6a1","target":"graph","created_at":"2026-07-05T09:57:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.16542/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gabriel Crudele, Jonathan A. Noel, Lina M. Simbaqueba, Natalie Behague","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-25T23:50:33Z","title":"Sidorenko-Type Inequalities for Pairs of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16542","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d253416fde6501c88c8d9e5cf942110a8ea9d300daabe196b206033f9fd41df4","target":"record","created_at":"2026-07-05T09:57:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bcfab5ff7dd1e6953fbe5ecf5dcf7cbec94fce92eb6c35897d186d67f4e4139d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-25T23:50:33Z","title_canon_sha256":"8602d02b2a5317926234ea8fac61238cf3fec36b3390e90176010b979a208835"},"schema_version":"1.0","source":{"id":"2305.16542","kind":"arxiv","version":2}},"canonical_sha256":"add81629cb9f70dad25a6a4938b9b514c6bfa9c7be6066a83aac734d477f9232","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"add81629cb9f70dad25a6a4938b9b514c6bfa9c7be6066a83aac734d477f9232","first_computed_at":"2026-07-05T09:57:37.334497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:57:37.334497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/NCEr1PpUUIrzBkuh0BjR+q/8u2mEiIPTjZpo/UuGbxoaoiElC27xcHdhRGSpmKWl3HEwOLCZHTXWcFm5kh9AA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:57:37.334959Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.16542","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d253416fde6501c88c8d9e5cf942110a8ea9d300daabe196b206033f9fd41df4","sha256:7d7ea3476db671e194aa2e7624222c62e0f688b4c6963dd73b34abf18a21e6a1"],"state_sha256":"5442b2a1fa6b857018925da42dc38b8e76a06068bc9aef6ac56a6d5806da3a11"}