{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RERHTHLZ55NNITO5GAKX7IMKDF","short_pith_number":"pith:RERHTHLZ","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"},"canonical_sha256":"8922799d79ef5ad44ddd30157fa18a1940dc5e58368e1f4b271c988764fc2465","source":{"kind":"arxiv","id":"1802.06686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06686","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06686v1","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06686","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"RERHTHLZ55NN","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RERHTHLZ55NNITO5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RERHTHLZ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RERHTHLZ55NNITO5GAKX7IMKDF","target":"record","payload":{"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"},"canonical_sha256":"8922799d79ef5ad44ddd30157fa18a1940dc5e58368e1f4b271c988764fc2465","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"},"source_kind":"arxiv","source_id":"1802.06686","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0/Jd/UbVS58iplZTpSlpnKCEl9Km62a28PYP/MWxRthD05BRCtYvPRW9UrDHRyOkLriS3TCNzOhP3jyWvRAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:09:59.432718Z"},"content_sha256":"b002e700401d1260ca573d3efedcfcc3415dbb4a1ae86b4afc05c3f532501328","schema_version":"1.0","event_id":"sha256:b002e700401d1260ca573d3efedcfcc3415dbb4a1ae86b4afc05c3f532501328"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RERHTHLZ55NNITO5GAKX7IMKDF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rz+3KNa+UmrUDK5Nj5cqw6A7mPmOFlxDMvTfKAEej+h471gWE+rYINXIxJxpiZVDWGGcnBSorNFZgKCHh2ZuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:09:59.433465Z"},"content_sha256":"cde16d96eefa49e4c919f324e54420e5f4aaad24fd94a409a1695323e2d6ffb0","schema_version":"1.0","event_id":"sha256:cde16d96eefa49e4c919f324e54420e5f4aaad24fd94a409a1695323e2d6ffb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF/bundle.json","state_url":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RERHTHLZ55NNITO5GAKX7IMKDF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T16:09:59Z","links":{"resolver":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF","bundle":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF/bundle.json","state":"https://pith.science/pith/RERHTHLZ55NNITO5GAKX7IMKDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RERHTHLZ55NNITO5GAKX7IMKDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RERHTHLZ55NNITO5GAKX7IMKDF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0e7a2e23acbcc8e977ae7d351fc3402f6c4f35e17db555a1267487fca6571989","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T16:06:32Z","title_canon_sha256":"ad7769c7bb1d9255048e0682bb19ba3ad1465456124437ae9e1505a47c4b9824"},"schema_version":"1.0","source":{"id":"1802.06686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06686","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06686v1","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06686","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"RERHTHLZ55NN","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RERHTHLZ55NNITO5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RERHTHLZ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:cde16d96eefa49e4c919f324e54420e5f4aaad24fd94a409a1695323e2d6ffb0","target":"graph","created_at":"2026-05-18T00:23:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Weiming Feng, Yitong Yin","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T16:06:32Z","title":"On Local Distributed Sampling and Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06686","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b002e700401d1260ca573d3efedcfcc3415dbb4a1ae86b4afc05c3f532501328","target":"record","created_at":"2026-05-18T00:23:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0e7a2e23acbcc8e977ae7d351fc3402f6c4f35e17db555a1267487fca6571989","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T16:06:32Z","title_canon_sha256":"ad7769c7bb1d9255048e0682bb19ba3ad1465456124437ae9e1505a47c4b9824"},"schema_version":"1.0","source":{"id":"1802.06686","kind":"arxiv","version":1}},"canonical_sha256":"8922799d79ef5ad44ddd30157fa18a1940dc5e58368e1f4b271c988764fc2465","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8922799d79ef5ad44ddd30157fa18a1940dc5e58368e1f4b271c988764fc2465","first_computed_at":"2026-05-18T00:23:02.577560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:02.577560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SmzekaY17Apev8HxqNRPO/4JhegdcWh2mDO1hAwI5TmUfKD+VjR/sQp5Jnz707CwUJrGMxdWTiHhyWx1LcDzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:02.578191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b002e700401d1260ca573d3efedcfcc3415dbb4a1ae86b4afc05c3f532501328","sha256:cde16d96eefa49e4c919f324e54420e5f4aaad24fd94a409a1695323e2d6ffb0"],"state_sha256":"4abe0c0bf29974f14e8b83be957f8822521bd9ab8538c3155859442aa8bb2075"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XDUz2QSzfOFis+ofk6BaOLyGTvZ7RKzyJvvDTp6e+oxyn2T5VtEh7YKa9+OaZ0N4mdOcT8SGrkz02xAA9D3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:09:59.437562Z","bundle_sha256":"42baba74bf7bd3050ed2b8856e0386cd758e7b9a9564aebfe2b40cb9550e4dcd"}}