{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RERHTHLZ55NNITO5GAKX7IMKDF","short_pith_number":"pith:RERHTHLZ","schema_version":"1.0","canonical_sha256":"8922799d79ef5ad44ddd30157fa18a1940dc5e58368e1f4b271c988764fc2465","source":{"kind":"arxiv","id":"1802.06686","version":1},"attestation_state":"computed","paper":{"title":"On Local Distributed Sampling and Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Weiming Feng, Yitong Yin","submitted_at":"2018-02-19T16:06:32Z","abstract_excerpt":"In classic distributed graph problems, each instance on a graph specifies a space of feasible solutions (e.g. all proper ($\\Delta+1$)-list-colorings of the graph), and the task of distributed algorithm is to construct a feasible solution using local information.\n  We study distributed sampling and counting problems, in which each instance specifies a joint distribution of feasible solutions. The task of distributed algorithm is to sample from this joint distribution, or to locally measure the volume of the probability space via the marginal probabilities. The latter task is also known as infer"},"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":"1802.06686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T16:06:32Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ad7769c7bb1d9255048e0682bb19ba3ad1465456124437ae9e1505a47c4b9824","abstract_canon_sha256":"0e7a2e23acbcc8e977ae7d351fc3402f6c4f35e17db555a1267487fca6571989"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:02.578191Z","signature_b64":"SmzekaY17Apev8HxqNRPO/4JhegdcWh2mDO1hAwI5TmUfKD+VjR/sQp5Jnz707CwUJrGMxdWTiHhyWx1LcDzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8922799d79ef5ad44ddd30157fa18a1940dc5e58368e1f4b271c988764fc2465","last_reissued_at":"2026-05-18T00:23:02.577560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:02.577560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Local Distributed Sampling and Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Weiming Feng, Yitong Yin","submitted_at":"2018-02-19T16:06:32Z","abstract_excerpt":"In classic distributed graph problems, each instance on a graph specifies a space of feasible solutions (e.g. all proper ($\\Delta+1$)-list-colorings of the graph), and the task of distributed algorithm is to construct a feasible solution using local information.\n  We study distributed sampling and counting problems, in which each instance specifies a joint distribution of feasible solutions. The task of distributed algorithm is to sample from this joint distribution, or to locally measure the volume of the probability space via the marginal probabilities. The latter task is also known as infer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06686","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":"1802.06686","created_at":"2026-05-18T00:23:02.577657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06686v1","created_at":"2026-05-18T00:23:02.577657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06686","created_at":"2026-05-18T00:23:02.577657+00:00"},{"alias_kind":"pith_short_12","alias_value":"RERHTHLZ55NN","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RERHTHLZ55NNITO5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RERHTHLZ","created_at":"2026-05-18T12:32:50.500415+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/RERHTHLZ55NNITO5GAKX7IMKDF","json":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF.json","graph_json":"https://pith.science/api/pith-number/RERHTHLZ55NNITO5GAKX7IMKDF/graph.json","events_json":"https://pith.science/api/pith-number/RERHTHLZ55NNITO5GAKX7IMKDF/events.json","paper":"https://pith.science/paper/RERHTHLZ"},"agent_actions":{"view_html":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF","download_json":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF.json","view_paper":"https://pith.science/paper/RERHTHLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06686&json=true","fetch_graph":"https://pith.science/api/pith-number/RERHTHLZ55NNITO5GAKX7IMKDF/graph.json","fetch_events":"https://pith.science/api/pith-number/RERHTHLZ55NNITO5GAKX7IMKDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF/action/storage_attestation","attest_author":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF/action/author_attestation","sign_citation":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF/action/citation_signature","submit_replication":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF/action/replication_record"}},"created_at":"2026-05-18T00:23:02.577657+00:00","updated_at":"2026-05-18T00:23:02.577657+00:00"}