{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OJXTZ7KAICSMJL6NGOAPMQTGP7","short_pith_number":"pith:OJXTZ7KA","canonical_record":{"source":{"id":"1703.05160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-15T14:01:21Z","cross_cats_sorted":["cs.DB","cs.DS","cs.LG"],"title_canon_sha256":"49e60681bbc1b63ee606564df75663e91e2ebacff85d2649005852d8e524331d","abstract_canon_sha256":"381ac94329f76ed93a41a3253cd9c7fc530f005dd25a037f648179029ad33c53"},"schema_version":"1.0"},"canonical_sha256":"726f3cfd4040a4c4afcd3380f642667fdae7cb6db98c6841f339006f4d6c3753","source":{"kind":"arxiv","id":"1703.05160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05160","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05160v1","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05160","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"pith_short_12","alias_value":"OJXTZ7KAICSM","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OJXTZ7KAICSMJL6N","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OJXTZ7KA","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OJXTZ7KAICSMJL6NGOAPMQTGP7","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-15T14:01:21Z","cross_cats_sorted":["cs.DB","cs.DS","cs.LG"],"title_canon_sha256":"49e60681bbc1b63ee606564df75663e91e2ebacff85d2649005852d8e524331d","abstract_canon_sha256":"381ac94329f76ed93a41a3253cd9c7fc530f005dd25a037f648179029ad33c53"},"schema_version":"1.0"},"canonical_sha256":"726f3cfd4040a4c4afcd3380f642667fdae7cb6db98c6841f339006f4d6c3753","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:38.175650Z","signature_b64":"FfSPIbkGgx3+W5JW6oPypL/j+B8g3wCME1sdZ6jcfYQ4ZbvjeLq/HYN32NGxnHd5cueaX7CmVtZUSn6mZwprAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"726f3cfd4040a4c4afcd3380f642667fdae7cb6db98c6841f339006f4d6c3753","last_reissued_at":"2026-05-18T00:48:38.174901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:38.174901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05160","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:48:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7Ulm/N/kcVd6DSQu0sDVQRczG/hQ3Whr4REi2Lr1jE56By5/Bz3GJdw9KpHqXpJinfNROcJ2hmPcr1OKZaODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:58:41.943812Z"},"content_sha256":"ee88bf8da1e40b6db4caf3e3db95a0a5fa1fa11e2d4ca4e2222f83ba1ec4aeab","schema_version":"1.0","event_id":"sha256:ee88bf8da1e40b6db4caf3e3db95a0a5fa1fa11e2d4ca4e2222f83ba1ec4aeab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OJXTZ7KAICSMJL6NGOAPMQTGP7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Anshumali Shrivastava, Ryan Spring","submitted_at":"2017-03-15T14:01:21Z","abstract_excerpt":"Log-linear models are arguably the most successful class of graphical models for large-scale applications because of their simplicity and tractability. Learning and inference with these models require calculating the partition function, which is a major bottleneck and intractable for large state spaces. Importance Sampling (IS) and MCMC-based approaches are lucrative. However, the condition of having a \"good\" proposal distribution is often not satisfied in practice.\n  In this paper, we add a new dimension to efficient estimation via sampling. We propose a new sampling scheme and an unbiased es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05160","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:48:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nbpUAzhBBP+KodAf+NUOTfkjr+AXnB8xBu/WTgik+Kl8PbpjnTE83x95HXxmsZDEQl/ex2fNp8e5ZZdCFc6QDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:58:41.944578Z"},"content_sha256":"d8ca2065ce1f7c063437d1f48678d773c13df91e6d1eb3a42cf0896c3aad36b6","schema_version":"1.0","event_id":"sha256:d8ca2065ce1f7c063437d1f48678d773c13df91e6d1eb3a42cf0896c3aad36b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7/bundle.json","state_url":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7/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-06-10T10:58:41Z","links":{"resolver":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7","bundle":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7/bundle.json","state":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OJXTZ7KAICSMJL6NGOAPMQTGP7","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":"381ac94329f76ed93a41a3253cd9c7fc530f005dd25a037f648179029ad33c53","cross_cats_sorted":["cs.DB","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-15T14:01:21Z","title_canon_sha256":"49e60681bbc1b63ee606564df75663e91e2ebacff85d2649005852d8e524331d"},"schema_version":"1.0","source":{"id":"1703.05160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05160","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05160v1","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05160","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"pith_short_12","alias_value":"OJXTZ7KAICSM","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OJXTZ7KAICSMJL6N","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OJXTZ7KA","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:d8ca2065ce1f7c063437d1f48678d773c13df91e6d1eb3a42cf0896c3aad36b6","target":"graph","created_at":"2026-05-18T00:48:38Z","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":"Log-linear models are arguably the most successful class of graphical models for large-scale applications because of their simplicity and tractability. Learning and inference with these models require calculating the partition function, which is a major bottleneck and intractable for large state spaces. Importance Sampling (IS) and MCMC-based approaches are lucrative. However, the condition of having a \"good\" proposal distribution is often not satisfied in practice.\n  In this paper, we add a new dimension to efficient estimation via sampling. We propose a new sampling scheme and an unbiased es","authors_text":"Anshumali Shrivastava, Ryan Spring","cross_cats":["cs.DB","cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-15T14:01:21Z","title":"A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05160","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:ee88bf8da1e40b6db4caf3e3db95a0a5fa1fa11e2d4ca4e2222f83ba1ec4aeab","target":"record","created_at":"2026-05-18T00:48:38Z","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":"381ac94329f76ed93a41a3253cd9c7fc530f005dd25a037f648179029ad33c53","cross_cats_sorted":["cs.DB","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-15T14:01:21Z","title_canon_sha256":"49e60681bbc1b63ee606564df75663e91e2ebacff85d2649005852d8e524331d"},"schema_version":"1.0","source":{"id":"1703.05160","kind":"arxiv","version":1}},"canonical_sha256":"726f3cfd4040a4c4afcd3380f642667fdae7cb6db98c6841f339006f4d6c3753","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"726f3cfd4040a4c4afcd3380f642667fdae7cb6db98c6841f339006f4d6c3753","first_computed_at":"2026-05-18T00:48:38.174901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:38.174901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FfSPIbkGgx3+W5JW6oPypL/j+B8g3wCME1sdZ6jcfYQ4ZbvjeLq/HYN32NGxnHd5cueaX7CmVtZUSn6mZwprAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:38.175650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee88bf8da1e40b6db4caf3e3db95a0a5fa1fa11e2d4ca4e2222f83ba1ec4aeab","sha256:d8ca2065ce1f7c063437d1f48678d773c13df91e6d1eb3a42cf0896c3aad36b6"],"state_sha256":"9ff1e90291e81c987471d942b43b5409b48b6951e00e5632a1ec6cdff3712459"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOF4PZWLL/w8frH0OZL07OSJw95dHRHCaYfPilbXF+L2jxNapIUeI/4oILHF0YdJecMSO4fomgLlliqK06gnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:58:41.949076Z","bundle_sha256":"5dc29466629a37fea5c4cce46ad2f813f0f659cc28e7a6502070d5a18fde1d1d"}}