{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AYNH7SKOY4VEFMD2DT7AHFIRV3","short_pith_number":"pith:AYNH7SKO","schema_version":"1.0","canonical_sha256":"061a7fc94ec72a42b07a1cfe039511aed8a8fadb2b4e96e92733580d49ba8912","source":{"kind":"arxiv","id":"2204.02570","version":2},"attestation_state":"computed","paper":{"title":"Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.PR","stat.ML"],"primary_cat":"cs.DS","authors_text":"Nima Anari, Thuy-Duong Vuong, Yang P. Liu","submitted_at":"2022-04-06T04:11:26Z","abstract_excerpt":"We design fast algorithms for repeatedly sampling from strongly Rayleigh distributions, which include random spanning tree distributions and determinantal point processes. For a graph $G=(V, E)$, we show how to approximately sample uniformly random spanning trees from $G$ in $\\widetilde{O}(\\lvert V\\rvert)$ time per sample after an initial $\\widetilde{O}(\\lvert E\\rvert)$ time preprocessing. For a determinantal point process on subsets of size $k$ of a ground set of $n$ elements, we show how to approximately sample in $\\widetilde{O}(k^\\omega)$ time after an initial $\\widetilde{O}(nk^{\\omega-1})$"},"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":"2204.02570","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-04-06T04:11:26Z","cross_cats_sorted":["cs.LG","math.PR","stat.ML"],"title_canon_sha256":"41fa4a76e3cd40416db29bb78bf2b86add907538ee2ea03fdca32be8076efe07","abstract_canon_sha256":"23a5b25a129afb67765da7067d1b17868717cbaaa0d454cb64a73b8fe4bef330"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:36.050796Z","signature_b64":"6x8r7Ft1oLbJW1XayKwy/ngXpC1/UmStUO0py9kupcqh3du781NiTLDFBOFUwTxIgE7TCA7RH7Vx9K8H3vnUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"061a7fc94ec72a42b07a1cfe039511aed8a8fadb2b4e96e92733580d49ba8912","last_reissued_at":"2026-07-05T04:58:36.050346Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:36.050346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.PR","stat.ML"],"primary_cat":"cs.DS","authors_text":"Nima Anari, Thuy-Duong Vuong, Yang P. Liu","submitted_at":"2022-04-06T04:11:26Z","abstract_excerpt":"We design fast algorithms for repeatedly sampling from strongly Rayleigh distributions, which include random spanning tree distributions and determinantal point processes. For a graph $G=(V, E)$, we show how to approximately sample uniformly random spanning trees from $G$ in $\\widetilde{O}(\\lvert V\\rvert)$ time per sample after an initial $\\widetilde{O}(\\lvert E\\rvert)$ time preprocessing. For a determinantal point process on subsets of size $k$ of a ground set of $n$ elements, we show how to approximately sample in $\\widetilde{O}(k^\\omega)$ time after an initial $\\widetilde{O}(nk^{\\omega-1})$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.02570","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/2204.02570/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":"2204.02570","created_at":"2026-07-05T04:58:36.050404+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.02570v2","created_at":"2026-07-05T04:58:36.050404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.02570","created_at":"2026-07-05T04:58:36.050404+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYNH7SKOY4VE","created_at":"2026-07-05T04:58:36.050404+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYNH7SKOY4VEFMD2","created_at":"2026-07-05T04:58:36.050404+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYNH7SKO","created_at":"2026-07-05T04:58:36.050404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.04639","citing_title":"Language translation, and change of accent for speech-to-speech task using diffusion model","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AYNH7SKOY4VEFMD2DT7AHFIRV3","json":"https://pith.science/pith/AYNH7SKOY4VEFMD2DT7AHFIRV3.json","graph_json":"https://pith.science/api/pith-number/AYNH7SKOY4VEFMD2DT7AHFIRV3/graph.json","events_json":"https://pith.science/api/pith-number/AYNH7SKOY4VEFMD2DT7AHFIRV3/events.json","paper":"https://pith.science/paper/AYNH7SKO"},"agent_actions":{"view_html":"https://pith.science/pith/AYNH7SKOY4VEFMD2DT7AHFIRV3","download_json":"https://pith.science/pith/AYNH7SKOY4VEFMD2DT7AHFIRV3.json","view_paper":"https://pith.science/paper/AYNH7SKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.02570&json=true","fetch_graph":"https://pith.science/api/pith-number/AYNH7SKOY4VEFMD2DT7AHFIRV3/graph.json","fetch_events":"https://pith.science/api/pith-number/AYNH7SKOY4VEFMD2DT7AHFIRV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYNH7SKOY4VEFMD2DT7AHFIRV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYNH7SKOY4VEFMD2DT7AHFIRV3/action/storage_attestation","attest_author":"https://pith.science/pith/AYNH7SKOY4VEFMD2DT7AHFIRV3/action/author_attestation","sign_citation":"https://pith.science/pith/AYNH7SKOY4VEFMD2DT7AHFIRV3/action/citation_signature","submit_replication":"https://pith.science/pith/AYNH7SKOY4VEFMD2DT7AHFIRV3/action/replication_record"}},"created_at":"2026-07-05T04:58:36.050404+00:00","updated_at":"2026-07-05T04:58:36.050404+00:00"}