{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WT7TJ66CAZU56KWRCXBG6HTUMX","short_pith_number":"pith:WT7TJ66C","canonical_record":{"source":{"id":"1309.6851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-26T12:46:13Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"4dde8b0c1a60bb9bfb9be6f1f4f33c5f8a88f6a3f34dd9857ae432cca82a88ca","abstract_canon_sha256":"65157abe43386f4ee82ec7740587decb70b8b15df818404f2369ee7bb4fdf23c"},"schema_version":"1.0"},"canonical_sha256":"b4ff34fbc20669df2ad115c26f1e7465c1c6b71ec3854acaf86f9cdf4cc90058","source":{"kind":"arxiv","id":"1309.6851","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6851","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6851v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6851","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"WT7TJ66CAZU5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WT7TJ66CAZU56KWR","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WT7TJ66C","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WT7TJ66CAZU56KWRCXBG6HTUMX","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-26T12:46:13Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"4dde8b0c1a60bb9bfb9be6f1f4f33c5f8a88f6a3f34dd9857ae432cca82a88ca","abstract_canon_sha256":"65157abe43386f4ee82ec7740587decb70b8b15df818404f2369ee7bb4fdf23c"},"schema_version":"1.0"},"canonical_sha256":"b4ff34fbc20669df2ad115c26f1e7465c1c6b71ec3854acaf86f9cdf4cc90058","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.075736Z","signature_b64":"CgncjfUDEDu18ljIs8Zx7eysZkcwdnGs4yyb9jJDxM8S9suUMm83PDFrrQ3muKwB4Wak2fybKuA6OdQaQ+pCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4ff34fbc20669df2ad115c26f1e7465c1c6b71ec3854acaf86f9cdf4cc90058","last_reissued_at":"2026-05-18T03:12:10.075098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.075098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6851","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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAsGbQk0nm8p8cx/20LTDdeSWaq8mXHcVgfujVxoDoELDFkWmX27wHqO8Z+kiHlc2NAGuCz6g48xU4BM/B5yCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:32:14.984656Z"},"content_sha256":"451880afe3f7b1c728f79b3f31cc49256f3796cec2df9919363ca238bca574c1","schema_version":"1.0","event_id":"sha256:451880afe3f7b1c728f79b3f31cc49256f3796cec2df9919363ca238bca574c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WT7TJ66CAZU56KWRCXBG6HTUMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Treedy: A Heuristic for Counting and Sampling Subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DS","authors_text":"Mikko Koivisto, Teppo Niinimaki","submitted_at":"2013-09-26T12:46:13Z","abstract_excerpt":"Consider a collection of weighted subsets of a ground set N. Given a query subset Q of N, how fast can one (1) find the weighted sum over all subsets of Q, and (2) sample a subset of Q proportionally to the weights? We present a tree-based greedy heuristic, Treedy, that for a given positive tolerance d answers such counting and sampling queries to within a guaranteed relative error d and total variation distance d, respectively. Experimental results on artificial instances and in application to Bayesian structure discovery in Bayesian networks show that approximations yield dramatic savings in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6851","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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0ByxZHWBZmttj3QTBaJrwlZBsx4us3JTxBNfPV5O6zCDf5amCV7ACIVD1+tcZ4B0cH+qTqckA19VVvMPFGWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:32:14.985004Z"},"content_sha256":"98ccdc304301e4054ad1deb5fe4e74fb4c816bc1f66dbe5cb13dd9969d5744cb","schema_version":"1.0","event_id":"sha256:98ccdc304301e4054ad1deb5fe4e74fb4c816bc1f66dbe5cb13dd9969d5744cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WT7TJ66CAZU56KWRCXBG6HTUMX/bundle.json","state_url":"https://pith.science/pith/WT7TJ66CAZU56KWRCXBG6HTUMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WT7TJ66CAZU56KWRCXBG6HTUMX/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-07-01T02:32:14Z","links":{"resolver":"https://pith.science/pith/WT7TJ66CAZU56KWRCXBG6HTUMX","bundle":"https://pith.science/pith/WT7TJ66CAZU56KWRCXBG6HTUMX/bundle.json","state":"https://pith.science/pith/WT7TJ66CAZU56KWRCXBG6HTUMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WT7TJ66CAZU56KWRCXBG6HTUMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WT7TJ66CAZU56KWRCXBG6HTUMX","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":"65157abe43386f4ee82ec7740587decb70b8b15df818404f2369ee7bb4fdf23c","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-26T12:46:13Z","title_canon_sha256":"4dde8b0c1a60bb9bfb9be6f1f4f33c5f8a88f6a3f34dd9857ae432cca82a88ca"},"schema_version":"1.0","source":{"id":"1309.6851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6851","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6851v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6851","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"WT7TJ66CAZU5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WT7TJ66CAZU56KWR","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WT7TJ66C","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:98ccdc304301e4054ad1deb5fe4e74fb4c816bc1f66dbe5cb13dd9969d5744cb","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"Consider a collection of weighted subsets of a ground set N. Given a query subset Q of N, how fast can one (1) find the weighted sum over all subsets of Q, and (2) sample a subset of Q proportionally to the weights? We present a tree-based greedy heuristic, Treedy, that for a given positive tolerance d answers such counting and sampling queries to within a guaranteed relative error d and total variation distance d, respectively. Experimental results on artificial instances and in application to Bayesian structure discovery in Bayesian networks show that approximations yield dramatic savings in","authors_text":"Mikko Koivisto, Teppo Niinimaki","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-26T12:46:13Z","title":"Treedy: A Heuristic for Counting and Sampling Subsets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6851","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:451880afe3f7b1c728f79b3f31cc49256f3796cec2df9919363ca238bca574c1","target":"record","created_at":"2026-05-18T03:12:10Z","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":"65157abe43386f4ee82ec7740587decb70b8b15df818404f2369ee7bb4fdf23c","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-26T12:46:13Z","title_canon_sha256":"4dde8b0c1a60bb9bfb9be6f1f4f33c5f8a88f6a3f34dd9857ae432cca82a88ca"},"schema_version":"1.0","source":{"id":"1309.6851","kind":"arxiv","version":1}},"canonical_sha256":"b4ff34fbc20669df2ad115c26f1e7465c1c6b71ec3854acaf86f9cdf4cc90058","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4ff34fbc20669df2ad115c26f1e7465c1c6b71ec3854acaf86f9cdf4cc90058","first_computed_at":"2026-05-18T03:12:10.075098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.075098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CgncjfUDEDu18ljIs8Zx7eysZkcwdnGs4yyb9jJDxM8S9suUMm83PDFrrQ3muKwB4Wak2fybKuA6OdQaQ+pCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.075736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:451880afe3f7b1c728f79b3f31cc49256f3796cec2df9919363ca238bca574c1","sha256:98ccdc304301e4054ad1deb5fe4e74fb4c816bc1f66dbe5cb13dd9969d5744cb"],"state_sha256":"3ba7e34b6371a8fb76665de5cea0b15cdc9712cdcce47fb146c3a3768fed19fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pcNCSuo2ELGBstyBYL4FVmkb01als2a8z2byEvy2Z5AUtwcMEo9iG6dEhKLeEUkFYcgtkB8e4swuqT0mcHBmDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T02:32:14.986981Z","bundle_sha256":"e3afc3999ba68d0558c62b0338c515790fdabb14511c28968bf072b1fb852fbd"}}