{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OJXTZ7KAICSMJL6NGOAPMQTGP7","short_pith_number":"pith:OJXTZ7KA","schema_version":"1.0","canonical_sha256":"726f3cfd4040a4c4afcd3380f642667fdae7cb6db98c6841f339006f4d6c3753","source":{"kind":"arxiv","id":"1703.05160","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.05160","created_at":"2026-05-18T00:48:38.175013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05160v1","created_at":"2026-05-18T00:48:38.175013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05160","created_at":"2026-05-18T00:48:38.175013+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJXTZ7KAICSM","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJXTZ7KAICSMJL6N","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJXTZ7KA","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09472","citing_title":"Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7","json":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7.json","graph_json":"https://pith.science/api/pith-number/OJXTZ7KAICSMJL6NGOAPMQTGP7/graph.json","events_json":"https://pith.science/api/pith-number/OJXTZ7KAICSMJL6NGOAPMQTGP7/events.json","paper":"https://pith.science/paper/OJXTZ7KA"},"agent_actions":{"view_html":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7","download_json":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7.json","view_paper":"https://pith.science/paper/OJXTZ7KA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05160&json=true","fetch_graph":"https://pith.science/api/pith-number/OJXTZ7KAICSMJL6NGOAPMQTGP7/graph.json","fetch_events":"https://pith.science/api/pith-number/OJXTZ7KAICSMJL6NGOAPMQTGP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7/action/storage_attestation","attest_author":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7/action/author_attestation","sign_citation":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7/action/citation_signature","submit_replication":"https://pith.science/pith/OJXTZ7KAICSMJL6NGOAPMQTGP7/action/replication_record"}},"created_at":"2026-05-18T00:48:38.175013+00:00","updated_at":"2026-05-18T00:48:38.175013+00:00"}