{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GYHGK7Z5JN435JOWLSCOR2T3EQ","short_pith_number":"pith:GYHGK7Z5","schema_version":"1.0","canonical_sha256":"360e657f3d4b79bea5d65c84e8ea7b240a43dc0308aa04466d54c2c66ef5bded","source":{"kind":"arxiv","id":"1809.03397","version":2},"attestation_state":"computed","paper":{"title":"Bellman function sitting on a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP","math.FA"],"primary_cat":"math.CA","authors_text":"Alexander Volberg, Irina Holmes, Nicola Arcozzi, Pavel Mozolyako","submitted_at":"2018-09-10T15:29:46Z","abstract_excerpt":"In this note we give a proof-by-formula of certain important embedding inequalities on dyadic tree. This is done with the help of Bellman function. We also consider the case of a bi-tree, where a different approach is explained."},"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":"1809.03397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2018-09-10T15:29:46Z","cross_cats_sorted":["math.AP","math.FA"],"title_canon_sha256":"5cec46f0b9924adac4e13c6bda6fb5f5fcaa11e78fd1a70c2dfcaecb55817063","abstract_canon_sha256":"514c4ebe365013f4d4ac8b701b7a5d1b40351a1302a09257f68a4ffac6d8c1be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:57.124700Z","signature_b64":"MNR2GqBAtPKdTudexbGGs0AmJa/dKE7jM1xo+9CfT1KtLcwyEKRYWjaJ0/iKZNBMgFonQ8xIGF9ESnmXtKljAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"360e657f3d4b79bea5d65c84e8ea7b240a43dc0308aa04466d54c2c66ef5bded","last_reissued_at":"2026-05-17T23:57:57.123928Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:57.123928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bellman function sitting on a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP","math.FA"],"primary_cat":"math.CA","authors_text":"Alexander Volberg, Irina Holmes, Nicola Arcozzi, Pavel Mozolyako","submitted_at":"2018-09-10T15:29:46Z","abstract_excerpt":"In this note we give a proof-by-formula of certain important embedding inequalities on dyadic tree. This is done with the help of Bellman function. We also consider the case of a bi-tree, where a different approach is explained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03397","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":""},"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":"1809.03397","created_at":"2026-05-17T23:57:57.124032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.03397v2","created_at":"2026-05-17T23:57:57.124032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03397","created_at":"2026-05-17T23:57:57.124032+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYHGK7Z5JN43","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYHGK7Z5JN435JOW","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYHGK7Z5","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11145","citing_title":"Counterexamples for bi-parameter Carleson embedding","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GYHGK7Z5JN435JOWLSCOR2T3EQ","json":"https://pith.science/pith/GYHGK7Z5JN435JOWLSCOR2T3EQ.json","graph_json":"https://pith.science/api/pith-number/GYHGK7Z5JN435JOWLSCOR2T3EQ/graph.json","events_json":"https://pith.science/api/pith-number/GYHGK7Z5JN435JOWLSCOR2T3EQ/events.json","paper":"https://pith.science/paper/GYHGK7Z5"},"agent_actions":{"view_html":"https://pith.science/pith/GYHGK7Z5JN435JOWLSCOR2T3EQ","download_json":"https://pith.science/pith/GYHGK7Z5JN435JOWLSCOR2T3EQ.json","view_paper":"https://pith.science/paper/GYHGK7Z5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.03397&json=true","fetch_graph":"https://pith.science/api/pith-number/GYHGK7Z5JN435JOWLSCOR2T3EQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GYHGK7Z5JN435JOWLSCOR2T3EQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYHGK7Z5JN435JOWLSCOR2T3EQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYHGK7Z5JN435JOWLSCOR2T3EQ/action/storage_attestation","attest_author":"https://pith.science/pith/GYHGK7Z5JN435JOWLSCOR2T3EQ/action/author_attestation","sign_citation":"https://pith.science/pith/GYHGK7Z5JN435JOWLSCOR2T3EQ/action/citation_signature","submit_replication":"https://pith.science/pith/GYHGK7Z5JN435JOWLSCOR2T3EQ/action/replication_record"}},"created_at":"2026-05-17T23:57:57.124032+00:00","updated_at":"2026-05-17T23:57:57.124032+00:00"}