{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DDNT2ZQ7YTELVOMPGV2XVKK2J3","short_pith_number":"pith:DDNT2ZQ7","schema_version":"1.0","canonical_sha256":"18db3d661fc4c8bab98f35757aa95a4eed39b72d1a2018006269d9440309ee01","source":{"kind":"arxiv","id":"2408.13045","version":2},"attestation_state":"computed","paper":{"title":"The adaptive complexity of parallelized log-concave sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baoxiang Wang, Huanjian Zhou, Masashi Sugiyama","submitted_at":"2024-08-23T13:06:43Z","abstract_excerpt":"In large-data applications, such as the inference process of diffusion models, it is desirable to design sampling algorithms with a high degree of parallelization. In this work, we study the adaptive complexity of sampling, which is the minimum number of sequential rounds required to achieve sampling given polynomially many queries executed in parallel at each round. For unconstrained sampling, we examine distributions that are log-smooth or log-Lipschitz and log strongly or non-strongly concave. We show that an almost linear iteration algorithm cannot return a sample with a specific exponenti"},"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":"2408.13045","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-08-23T13:06:43Z","cross_cats_sorted":[],"title_canon_sha256":"6a582292daacf471bce456a3694e39f1198ab5158ab8000dea0cedbcecc01dca","abstract_canon_sha256":"f00584e66f99a417caaac9749475cebecc05c035d845d0adf1010cf7b18cf6e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:34.482229Z","signature_b64":"KPOXUj5kGPIXJVr5T/2/t01FV+Jltf2PlFWRSzd3DndCYeAqhV3m3cUiAZrA2oBj8Csy34SidBUIiuv6iLdsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18db3d661fc4c8bab98f35757aa95a4eed39b72d1a2018006269d9440309ee01","last_reissued_at":"2026-07-05T11:05:34.481765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:34.481765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The adaptive complexity of parallelized log-concave sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baoxiang Wang, Huanjian Zhou, Masashi Sugiyama","submitted_at":"2024-08-23T13:06:43Z","abstract_excerpt":"In large-data applications, such as the inference process of diffusion models, it is desirable to design sampling algorithms with a high degree of parallelization. In this work, we study the adaptive complexity of sampling, which is the minimum number of sequential rounds required to achieve sampling given polynomially many queries executed in parallel at each round. For unconstrained sampling, we examine distributions that are log-smooth or log-Lipschitz and log strongly or non-strongly concave. We show that an almost linear iteration algorithm cannot return a sample with a specific exponenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.13045","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.13045/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":"2408.13045","created_at":"2026-07-05T11:05:34.481827+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.13045v2","created_at":"2026-07-05T11:05:34.481827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.13045","created_at":"2026-07-05T11:05:34.481827+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDNT2ZQ7YTEL","created_at":"2026-07-05T11:05:34.481827+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDNT2ZQ7YTELVOMP","created_at":"2026-07-05T11:05:34.481827+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDNT2ZQ7","created_at":"2026-07-05T11:05:34.481827+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/DDNT2ZQ7YTELVOMPGV2XVKK2J3","json":"https://pith.science/pith/DDNT2ZQ7YTELVOMPGV2XVKK2J3.json","graph_json":"https://pith.science/api/pith-number/DDNT2ZQ7YTELVOMPGV2XVKK2J3/graph.json","events_json":"https://pith.science/api/pith-number/DDNT2ZQ7YTELVOMPGV2XVKK2J3/events.json","paper":"https://pith.science/paper/DDNT2ZQ7"},"agent_actions":{"view_html":"https://pith.science/pith/DDNT2ZQ7YTELVOMPGV2XVKK2J3","download_json":"https://pith.science/pith/DDNT2ZQ7YTELVOMPGV2XVKK2J3.json","view_paper":"https://pith.science/paper/DDNT2ZQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.13045&json=true","fetch_graph":"https://pith.science/api/pith-number/DDNT2ZQ7YTELVOMPGV2XVKK2J3/graph.json","fetch_events":"https://pith.science/api/pith-number/DDNT2ZQ7YTELVOMPGV2XVKK2J3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDNT2ZQ7YTELVOMPGV2XVKK2J3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDNT2ZQ7YTELVOMPGV2XVKK2J3/action/storage_attestation","attest_author":"https://pith.science/pith/DDNT2ZQ7YTELVOMPGV2XVKK2J3/action/author_attestation","sign_citation":"https://pith.science/pith/DDNT2ZQ7YTELVOMPGV2XVKK2J3/action/citation_signature","submit_replication":"https://pith.science/pith/DDNT2ZQ7YTELVOMPGV2XVKK2J3/action/replication_record"}},"created_at":"2026-07-05T11:05:34.481827+00:00","updated_at":"2026-07-05T11:05:34.481827+00:00"}