{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QQEGWPW3L5PIQKPIWCTV6ATO6J","short_pith_number":"pith:QQEGWPW3","schema_version":"1.0","canonical_sha256":"84086b3edb5f5e8829e8b0a75f026ef25aac1f4d1a65ae01a61a6a6e0a435d95","source":{"kind":"arxiv","id":"1301.7247","version":1},"attestation_state":"computed","paper":{"title":"Uniqueness for an inviscid stochastic dyadic model on a tree","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.PR","authors_text":"Luigi Amedeo Bianchi","submitted_at":"2013-01-30T14:44:41Z","abstract_excerpt":"In this paper we prove that the lack of uniqueness for solutions of the tree dyadic model of turbulence is overcome with the introduction of a suitable noise. The uniqueness is a weak probabilistic uniqueness for all $l^2$-initial conditions and is proven using a technique relying on the properties of the $q$-matrix associated to a continuous time Markov chain."},"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":"1301.7247","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.PR","submitted_at":"2013-01-30T14:44:41Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"5f0e83c8d26636191218cf4a6878e59d0d55bd2df12dbf56a552162e91d0352c","abstract_canon_sha256":"362f8265624016d1803512c056928b2e8fb74d55ba98eeca7e5d75f5f907abc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:15.790751Z","signature_b64":"dh4/n35oqt/BYmb/viWylCWNzNyBCNJdrPjiQaBicrRe236IQO8Rx1PYPYw0CsJiBaIQ0qLmlv5bNFrFBgp+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84086b3edb5f5e8829e8b0a75f026ef25aac1f4d1a65ae01a61a6a6e0a435d95","last_reissued_at":"2026-05-18T01:30:15.790251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:15.790251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniqueness for an inviscid stochastic dyadic model on a tree","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.PR","authors_text":"Luigi Amedeo Bianchi","submitted_at":"2013-01-30T14:44:41Z","abstract_excerpt":"In this paper we prove that the lack of uniqueness for solutions of the tree dyadic model of turbulence is overcome with the introduction of a suitable noise. The uniqueness is a weak probabilistic uniqueness for all $l^2$-initial conditions and is proven using a technique relying on the properties of the $q$-matrix associated to a continuous time Markov chain."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7247","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":"1301.7247","created_at":"2026-05-18T01:30:15.790341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7247v1","created_at":"2026-05-18T01:30:15.790341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7247","created_at":"2026-05-18T01:30:15.790341+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQEGWPW3L5PI","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQEGWPW3L5PIQKPI","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQEGWPW3","created_at":"2026-05-18T12:27:57.521954+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/QQEGWPW3L5PIQKPIWCTV6ATO6J","json":"https://pith.science/pith/QQEGWPW3L5PIQKPIWCTV6ATO6J.json","graph_json":"https://pith.science/api/pith-number/QQEGWPW3L5PIQKPIWCTV6ATO6J/graph.json","events_json":"https://pith.science/api/pith-number/QQEGWPW3L5PIQKPIWCTV6ATO6J/events.json","paper":"https://pith.science/paper/QQEGWPW3"},"agent_actions":{"view_html":"https://pith.science/pith/QQEGWPW3L5PIQKPIWCTV6ATO6J","download_json":"https://pith.science/pith/QQEGWPW3L5PIQKPIWCTV6ATO6J.json","view_paper":"https://pith.science/paper/QQEGWPW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7247&json=true","fetch_graph":"https://pith.science/api/pith-number/QQEGWPW3L5PIQKPIWCTV6ATO6J/graph.json","fetch_events":"https://pith.science/api/pith-number/QQEGWPW3L5PIQKPIWCTV6ATO6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQEGWPW3L5PIQKPIWCTV6ATO6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQEGWPW3L5PIQKPIWCTV6ATO6J/action/storage_attestation","attest_author":"https://pith.science/pith/QQEGWPW3L5PIQKPIWCTV6ATO6J/action/author_attestation","sign_citation":"https://pith.science/pith/QQEGWPW3L5PIQKPIWCTV6ATO6J/action/citation_signature","submit_replication":"https://pith.science/pith/QQEGWPW3L5PIQKPIWCTV6ATO6J/action/replication_record"}},"created_at":"2026-05-18T01:30:15.790341+00:00","updated_at":"2026-05-18T01:30:15.790341+00:00"}