{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7QVZB33NWN6MU5DAIH6YT4Y2YY","short_pith_number":"pith:7QVZB33N","canonical_record":{"source":{"id":"2408.03491","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-07T01:02:08Z","cross_cats_sorted":[],"title_canon_sha256":"0cf785967322b7a0b3f76583361f9d78a76a428d19050a141f7d9b2741a66d8f","abstract_canon_sha256":"eb137370312291cf4b94ae11240cbe05acaa61bad403ebaed4437cac3d8ebd33"},"schema_version":"1.0"},"canonical_sha256":"fc2b90ef6db37cca746041fd89f31ac63289875b703f03d41ebcbe8a9b2b72c8","source":{"kind":"arxiv","id":"2408.03491","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.03491","created_at":"2026-07-05T09:00:06Z"},{"alias_kind":"arxiv_version","alias_value":"2408.03491v2","created_at":"2026-07-05T09:00:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03491","created_at":"2026-07-05T09:00:06Z"},{"alias_kind":"pith_short_12","alias_value":"7QVZB33NWN6M","created_at":"2026-07-05T09:00:06Z"},{"alias_kind":"pith_short_16","alias_value":"7QVZB33NWN6MU5DA","created_at":"2026-07-05T09:00:06Z"},{"alias_kind":"pith_short_8","alias_value":"7QVZB33N","created_at":"2026-07-05T09:00:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7QVZB33NWN6MU5DAIH6YT4Y2YY","target":"record","payload":{"canonical_record":{"source":{"id":"2408.03491","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-07T01:02:08Z","cross_cats_sorted":[],"title_canon_sha256":"0cf785967322b7a0b3f76583361f9d78a76a428d19050a141f7d9b2741a66d8f","abstract_canon_sha256":"eb137370312291cf4b94ae11240cbe05acaa61bad403ebaed4437cac3d8ebd33"},"schema_version":"1.0"},"canonical_sha256":"fc2b90ef6db37cca746041fd89f31ac63289875b703f03d41ebcbe8a9b2b72c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:06.899604Z","signature_b64":"0L4r2ygBfg6nQwrRcTpEthv3/jVz6ER8zbpMW3KdcNDgdWgOgIywMzP0LQ3HnALxWFcOA+0Im0k3hlgoPOcwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc2b90ef6db37cca746041fd89f31ac63289875b703f03d41ebcbe8a9b2b72c8","last_reissued_at":"2026-07-05T09:00:06.899011Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:06.899011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.03491","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:00:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kzXxKLJtdA0RRf+QQmvyMRwtOB2m3GLn7dKOkVTdnNUKE8VekQiWpFGTsMqwDsBi4q8QpXK5AjIXIdoOMWU2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:25:20.919621Z"},"content_sha256":"4ccba75a3a6c1378924a80476d54eff042af781abfa907e6f5b3c3f43adaf9a2","schema_version":"1.0","event_id":"sha256:4ccba75a3a6c1378924a80476d54eff042af781abfa907e6f5b3c3f43adaf9a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7QVZB33NWN6MU5DAIH6YT4Y2YY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sidorenko's conjecture for subdivisions and theta substitutions","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Ruonan Li, Seonghyuk Im","submitted_at":"2024-08-07T01:02:08Z","abstract_excerpt":"The famous Sidorenko's conjecture asserts that for every bipartite graph $H$, the number of homomorphisms from $H$ to a graph $G$ with given edge density is minimized when $G$ is pseudorandom. We prove that for any graph $H$, a graph obtained from replacing edges of $H$ by generalized theta graphs consisting of even paths satisfies Sidorenko's conjecture, provided a certain divisibility condition on the number of paths. To achieve this, we prove unconditionally that bipartite graphs obtained from replacing each edge of a complete graph with a generalized theta graph satisfy Sidorenko's conject"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03491","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/2408.03491/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:00:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fpQ44AmL67ZyOgezTdA26UYx9hafqyk0g6s0MjILuzEZHYN8I0GF2i5JmMYYUz+y3bRbtszNSxnv48/zr2rKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:25:20.920053Z"},"content_sha256":"fd06f5d185c2d40b2defca821476a1616a438fd1f990f2f4153cbe8f4352ba75","schema_version":"1.0","event_id":"sha256:fd06f5d185c2d40b2defca821476a1616a438fd1f990f2f4153cbe8f4352ba75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QVZB33NWN6MU5DAIH6YT4Y2YY/bundle.json","state_url":"https://pith.science/pith/7QVZB33NWN6MU5DAIH6YT4Y2YY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QVZB33NWN6MU5DAIH6YT4Y2YY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T23:25:20Z","links":{"resolver":"https://pith.science/pith/7QVZB33NWN6MU5DAIH6YT4Y2YY","bundle":"https://pith.science/pith/7QVZB33NWN6MU5DAIH6YT4Y2YY/bundle.json","state":"https://pith.science/pith/7QVZB33NWN6MU5DAIH6YT4Y2YY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QVZB33NWN6MU5DAIH6YT4Y2YY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7QVZB33NWN6MU5DAIH6YT4Y2YY","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":"eb137370312291cf4b94ae11240cbe05acaa61bad403ebaed4437cac3d8ebd33","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-07T01:02:08Z","title_canon_sha256":"0cf785967322b7a0b3f76583361f9d78a76a428d19050a141f7d9b2741a66d8f"},"schema_version":"1.0","source":{"id":"2408.03491","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.03491","created_at":"2026-07-05T09:00:06Z"},{"alias_kind":"arxiv_version","alias_value":"2408.03491v2","created_at":"2026-07-05T09:00:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03491","created_at":"2026-07-05T09:00:06Z"},{"alias_kind":"pith_short_12","alias_value":"7QVZB33NWN6M","created_at":"2026-07-05T09:00:06Z"},{"alias_kind":"pith_short_16","alias_value":"7QVZB33NWN6MU5DA","created_at":"2026-07-05T09:00:06Z"},{"alias_kind":"pith_short_8","alias_value":"7QVZB33N","created_at":"2026-07-05T09:00:06Z"}],"graph_snapshots":[{"event_id":"sha256:fd06f5d185c2d40b2defca821476a1616a438fd1f990f2f4153cbe8f4352ba75","target":"graph","created_at":"2026-07-05T09:00:06Z","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/2408.03491/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The famous Sidorenko's conjecture asserts that for every bipartite graph $H$, the number of homomorphisms from $H$ to a graph $G$ with given edge density is minimized when $G$ is pseudorandom. We prove that for any graph $H$, a graph obtained from replacing edges of $H$ by generalized theta graphs consisting of even paths satisfies Sidorenko's conjecture, provided a certain divisibility condition on the number of paths. To achieve this, we prove unconditionally that bipartite graphs obtained from replacing each edge of a complete graph with a generalized theta graph satisfy Sidorenko's conject","authors_text":"Hong Liu, Ruonan Li, Seonghyuk Im","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-07T01:02:08Z","title":"Sidorenko's conjecture for subdivisions and theta substitutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03491","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:4ccba75a3a6c1378924a80476d54eff042af781abfa907e6f5b3c3f43adaf9a2","target":"record","created_at":"2026-07-05T09:00:06Z","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":"eb137370312291cf4b94ae11240cbe05acaa61bad403ebaed4437cac3d8ebd33","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-07T01:02:08Z","title_canon_sha256":"0cf785967322b7a0b3f76583361f9d78a76a428d19050a141f7d9b2741a66d8f"},"schema_version":"1.0","source":{"id":"2408.03491","kind":"arxiv","version":2}},"canonical_sha256":"fc2b90ef6db37cca746041fd89f31ac63289875b703f03d41ebcbe8a9b2b72c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc2b90ef6db37cca746041fd89f31ac63289875b703f03d41ebcbe8a9b2b72c8","first_computed_at":"2026-07-05T09:00:06.899011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:00:06.899011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0L4r2ygBfg6nQwrRcTpEthv3/jVz6ER8zbpMW3KdcNDgdWgOgIywMzP0LQ3HnALxWFcOA+0Im0k3hlgoPOcwBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:00:06.899604Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.03491","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ccba75a3a6c1378924a80476d54eff042af781abfa907e6f5b3c3f43adaf9a2","sha256:fd06f5d185c2d40b2defca821476a1616a438fd1f990f2f4153cbe8f4352ba75"],"state_sha256":"1cd9ecd7ad0f4dcbb1c4ecef1b10c8e63b234c41e4bf8c8b5b6ddf54b396ed91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9lCrRh2d6YnVv2CAlQxCDzSgd73Sg03WU0QZAW74c6W49v2S8ejMJnRZV8n6TazjwhbMO6b2gvcdasNnEyfkBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T23:25:20.930051Z","bundle_sha256":"0dce1f2053c2604a4e1146a698075c5fd5adb2927a03bdfe82381bbd783615bb"}}