{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PS3FM5WPCN7RYBMC373P7XXKBT","short_pith_number":"pith:PS3FM5WP","schema_version":"1.0","canonical_sha256":"7cb65676cf137f1c0582dff6ffdeea0cd86d6121c025054eae3087f1b5a1c327","source":{"kind":"arxiv","id":"1805.02238","version":1},"attestation_state":"computed","paper":{"title":"Sidorenko's conjecture for higher tree decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Choongbum Lee, David Conlon, Jeong Han Kim, Joonkyung Lee","submitted_at":"2018-05-06T15:43:03Z","abstract_excerpt":"This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader class, comparable to that given in work of Szegedy, through further iteration."},"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":"1805.02238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-06T15:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"8bc2aa4e631cd16d1b6f3901a7101891cbcddc5e4740288e56c8164925777290","abstract_canon_sha256":"dedfca231343977eaf2559d287977e3c4328907ca016cf9eb73099777c79c9ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:40.488708Z","signature_b64":"Q3S5ltbWVykRd1pQS+52ad3kxLSAxVE3JmmEl+gzf52PUY5hApK+C4z9260Hv/H7awtA8H1WDCriOnNHS1sgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cb65676cf137f1c0582dff6ffdeea0cd86d6121c025054eae3087f1b5a1c327","last_reissued_at":"2026-05-18T00:16:40.488005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:40.488005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sidorenko's conjecture for higher tree decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Choongbum Lee, David Conlon, Jeong Han Kim, Joonkyung Lee","submitted_at":"2018-05-06T15:43:03Z","abstract_excerpt":"This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader class, comparable to that given in work of Szegedy, through further iteration."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02238","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":""},"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":"1805.02238","created_at":"2026-05-18T00:16:40.488128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02238v1","created_at":"2026-05-18T00:16:40.488128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02238","created_at":"2026-05-18T00:16:40.488128+00:00"},{"alias_kind":"pith_short_12","alias_value":"PS3FM5WPCN7R","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PS3FM5WPCN7RYBMC","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PS3FM5WP","created_at":"2026-05-18T12:32:46.962924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PS3FM5WPCN7RYBMC373P7XXKBT","json":"https://pith.science/pith/PS3FM5WPCN7RYBMC373P7XXKBT.json","graph_json":"https://pith.science/api/pith-number/PS3FM5WPCN7RYBMC373P7XXKBT/graph.json","events_json":"https://pith.science/api/pith-number/PS3FM5WPCN7RYBMC373P7XXKBT/events.json","paper":"https://pith.science/paper/PS3FM5WP"},"agent_actions":{"view_html":"https://pith.science/pith/PS3FM5WPCN7RYBMC373P7XXKBT","download_json":"https://pith.science/pith/PS3FM5WPCN7RYBMC373P7XXKBT.json","view_paper":"https://pith.science/paper/PS3FM5WP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02238&json=true","fetch_graph":"https://pith.science/api/pith-number/PS3FM5WPCN7RYBMC373P7XXKBT/graph.json","fetch_events":"https://pith.science/api/pith-number/PS3FM5WPCN7RYBMC373P7XXKBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PS3FM5WPCN7RYBMC373P7XXKBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PS3FM5WPCN7RYBMC373P7XXKBT/action/storage_attestation","attest_author":"https://pith.science/pith/PS3FM5WPCN7RYBMC373P7XXKBT/action/author_attestation","sign_citation":"https://pith.science/pith/PS3FM5WPCN7RYBMC373P7XXKBT/action/citation_signature","submit_replication":"https://pith.science/pith/PS3FM5WPCN7RYBMC373P7XXKBT/action/replication_record"}},"created_at":"2026-05-18T00:16:40.488128+00:00","updated_at":"2026-05-18T00:16:40.488128+00:00"}