{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X4AN6FK3ST65CWHUGO4MT2WE6J","short_pith_number":"pith:X4AN6FK3","schema_version":"1.0","canonical_sha256":"bf00df155b94fdd158f433b8c9eac4f24e1cd8eb85139254e9c855b0bcc13726","source":{"kind":"arxiv","id":"1902.06888","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Modeling with Matrix Product States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"James Stokes, John Terilla","submitted_at":"2019-02-19T04:22:59Z","abstract_excerpt":"Inspired by the possibility that generative models based on quantum circuits can provide a useful inductive bias for sequence modeling tasks, we propose an efficient training algorithm for a subset of classically simulable quantum circuit models. The gradient-free algorithm, presented as a sequence of exactly solvable effective models, is a modification of the density matrix renormalization group procedure adapted for learning a probability distribution. The conclusion that circuit-based models offer a useful inductive bias for classical datasets is supported by experimental results on the par"},"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":"1902.06888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-19T04:22:59Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"68edcd5d70791d6056661d7d3557165e51e236b598d4c335f206a5103001b743","abstract_canon_sha256":"e78b13258386644f981efb88b43ba7ddfb9f4565c50795d2ecee023b04ce63c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:41:24.391829Z","signature_b64":"7ZBMBVMZ39zAlj/q6G/mVVCjXNvl0EAVUi0X4oU0gK6W7KonqzhIt0QtysrrRz41ynmbD+iOYtK4FXeZrxlxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf00df155b94fdd158f433b8c9eac4f24e1cd8eb85139254e9c855b0bcc13726","last_reissued_at":"2026-07-05T00:41:24.391444Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:41:24.391444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Modeling with Matrix Product States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"James Stokes, John Terilla","submitted_at":"2019-02-19T04:22:59Z","abstract_excerpt":"Inspired by the possibility that generative models based on quantum circuits can provide a useful inductive bias for sequence modeling tasks, we propose an efficient training algorithm for a subset of classically simulable quantum circuit models. The gradient-free algorithm, presented as a sequence of exactly solvable effective models, is a modification of the density matrix renormalization group procedure adapted for learning a probability distribution. The conclusion that circuit-based models offer a useful inductive bias for classical datasets is supported by experimental results on the par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06888","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.06888/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1902.06888","created_at":"2026-07-05T00:41:24.391521+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.06888v1","created_at":"2026-07-05T00:41:24.391521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06888","created_at":"2026-07-05T00:41:24.391521+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4AN6FK3ST65","created_at":"2026-07-05T00:41:24.391521+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4AN6FK3ST65CWHU","created_at":"2026-07-05T00:41:24.391521+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4AN6FK3","created_at":"2026-07-05T00:41:24.391521+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09359","citing_title":"Accurate simulation for finite projected entangled pair states in two dimensions","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X4AN6FK3ST65CWHUGO4MT2WE6J","json":"https://pith.science/pith/X4AN6FK3ST65CWHUGO4MT2WE6J.json","graph_json":"https://pith.science/api/pith-number/X4AN6FK3ST65CWHUGO4MT2WE6J/graph.json","events_json":"https://pith.science/api/pith-number/X4AN6FK3ST65CWHUGO4MT2WE6J/events.json","paper":"https://pith.science/paper/X4AN6FK3"},"agent_actions":{"view_html":"https://pith.science/pith/X4AN6FK3ST65CWHUGO4MT2WE6J","download_json":"https://pith.science/pith/X4AN6FK3ST65CWHUGO4MT2WE6J.json","view_paper":"https://pith.science/paper/X4AN6FK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.06888&json=true","fetch_graph":"https://pith.science/api/pith-number/X4AN6FK3ST65CWHUGO4MT2WE6J/graph.json","fetch_events":"https://pith.science/api/pith-number/X4AN6FK3ST65CWHUGO4MT2WE6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4AN6FK3ST65CWHUGO4MT2WE6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4AN6FK3ST65CWHUGO4MT2WE6J/action/storage_attestation","attest_author":"https://pith.science/pith/X4AN6FK3ST65CWHUGO4MT2WE6J/action/author_attestation","sign_citation":"https://pith.science/pith/X4AN6FK3ST65CWHUGO4MT2WE6J/action/citation_signature","submit_replication":"https://pith.science/pith/X4AN6FK3ST65CWHUGO4MT2WE6J/action/replication_record"}},"created_at":"2026-07-05T00:41:24.391521+00:00","updated_at":"2026-07-05T00:41:24.391521+00:00"}