{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VDPKUXV7D4ACKJEXWWBGK4YO7I","short_pith_number":"pith:VDPKUXV7","schema_version":"1.0","canonical_sha256":"a8deaa5ebf1f00252497b58265730efa02c3e77913d22443e848789ba48d01dd","source":{"kind":"arxiv","id":"2608.13520","version":1},"attestation_state":"computed","paper":{"title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Martin J. Wainwright","submitted_at":"2026-08-13T17:40:17Z","abstract_excerpt":"We study masking diffusion for discrete sampling and introduce a path-resolved measure of data geometry called the \\emph{unmasking growth complexity} ({\\textsf{UGC}\\xspace}). Its local increments directly control Kullback--Leibler (KL) discretization error, yielding a unified analysis of Bernoulli-subset and fixed-cardinality unmasking schemes. In log-reveal-odds coordinates, this structure yields optimized single-block and multi-block schedules, and quantifies the gains from adapting computational effort to data geometry. Crucially, we show how {\\textsf{UGC}\\xspace} increments can be estimate"},"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":"2608.13520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-08-13T17:40:17Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"c92c96cb91e421dd6ac9d83ac094253f3797da70a3a14be38bd04035649c7bbb","abstract_canon_sha256":"da12888e738f583646bfb3d6ed8727726c0c9fd62c970565b3cd59122bff6d37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T01:24:56.853037Z","signature_b64":"aVOCFd5nbB+pLR0i45xj/yN5PZl7J8Nej3EfxkYFsZG/Mog4xObjgXX11lWBwDv3enM+VL4vdMFHs5FJF1edCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8deaa5ebf1f00252497b58265730efa02c3e77913d22443e848789ba48d01dd","last_reissued_at":"2026-08-14T01:24:56.850789Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T01:24:56.850789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Martin J. Wainwright","submitted_at":"2026-08-13T17:40:17Z","abstract_excerpt":"We study masking diffusion for discrete sampling and introduce a path-resolved measure of data geometry called the \\emph{unmasking growth complexity} ({\\textsf{UGC}\\xspace}). Its local increments directly control Kullback--Leibler (KL) discretization error, yielding a unified analysis of Bernoulli-subset and fixed-cardinality unmasking schemes. In log-reveal-odds coordinates, this structure yields optimized single-block and multi-block schedules, and quantifies the gains from adapting computational effort to data geometry. Crucially, we show how {\\textsf{UGC}\\xspace} increments can be estimate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.13520","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.13520/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.13520","created_at":"2026-08-14T01:24:56.852295+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.13520v1","created_at":"2026-08-14T01:24:56.852295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.13520","created_at":"2026-08-14T01:24:56.852295+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDPKUXV7D4AC","created_at":"2026-08-14T01:24:56.852295+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDPKUXV7D4ACKJEX","created_at":"2026-08-14T01:24:56.852295+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDPKUXV7","created_at":"2026-08-14T01:24:56.852295+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/VDPKUXV7D4ACKJEXWWBGK4YO7I","json":"https://pith.science/pith/VDPKUXV7D4ACKJEXWWBGK4YO7I.json","graph_json":"https://pith.science/api/pith-number/VDPKUXV7D4ACKJEXWWBGK4YO7I/graph.json","events_json":"https://pith.science/api/pith-number/VDPKUXV7D4ACKJEXWWBGK4YO7I/events.json","paper":"https://pith.science/paper/VDPKUXV7"},"agent_actions":{"view_html":"https://pith.science/pith/VDPKUXV7D4ACKJEXWWBGK4YO7I","download_json":"https://pith.science/pith/VDPKUXV7D4ACKJEXWWBGK4YO7I.json","view_paper":"https://pith.science/paper/VDPKUXV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.13520&json=true","fetch_graph":"https://pith.science/api/pith-number/VDPKUXV7D4ACKJEXWWBGK4YO7I/graph.json","fetch_events":"https://pith.science/api/pith-number/VDPKUXV7D4ACKJEXWWBGK4YO7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDPKUXV7D4ACKJEXWWBGK4YO7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDPKUXV7D4ACKJEXWWBGK4YO7I/action/storage_attestation","attest_author":"https://pith.science/pith/VDPKUXV7D4ACKJEXWWBGK4YO7I/action/author_attestation","sign_citation":"https://pith.science/pith/VDPKUXV7D4ACKJEXWWBGK4YO7I/action/citation_signature","submit_replication":"https://pith.science/pith/VDPKUXV7D4ACKJEXWWBGK4YO7I/action/replication_record"}},"created_at":"2026-08-14T01:24:56.852295+00:00","updated_at":"2026-08-14T01:24:56.852295+00:00"}