{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BDSSKH3JWF7HN4RZHXNX2V5GTM","short_pith_number":"pith:BDSSKH3J","schema_version":"1.0","canonical_sha256":"08e5251f69b17e76f2393ddb7d57a69b0fe044258fab01a3b1e8187ffeeb29c6","source":{"kind":"arxiv","id":"2501.18691","version":2},"attestation_state":"computed","paper":{"title":"Regularized second-order optimization of tensor-network Born machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.LG","authors_text":"Jing Chen, Matan Ben-Dov","submitted_at":"2025-01-30T19:00:04Z","abstract_excerpt":"Tensor-network Born machines (TNBMs) are quantum-inspired generative models for learning data distributions. Using tensor-network contraction and optimization techniques, the model learns an efficient representation of the target distribution, capable of capturing complex correlations with a compact parameterization. Despite their promise, the optimization of TNBMs presents several challenges. A key bottleneck of TNBMs is the logarithmic nature of the loss function commonly used for this problem. The single-tensor logarithmic optimization problem cannot be solved analytically, necessitating an"},"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":"2501.18691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-30T19:00:04Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"0b602aa18402b7051d3d5baa8ad3a874bd0589a259bb6169aa771943ab73f0c7","abstract_canon_sha256":"770026aaee4adaf22c6ca3a1ac88a676ad8a72cf80a78dcf3fadc92774045695"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:05.238422Z","signature_b64":"1BhikLtC4lV/R+paoIJbTU81e+kGF2+1z/3HwHY1zyFa7v59fJLqerI36TMw8ZulxpWbVqXmEyFOcJ21iF90AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08e5251f69b17e76f2393ddb7d57a69b0fe044258fab01a3b1e8187ffeeb29c6","last_reissued_at":"2026-07-05T10:59:05.237934Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:05.237934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularized second-order optimization of tensor-network Born machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.LG","authors_text":"Jing Chen, Matan Ben-Dov","submitted_at":"2025-01-30T19:00:04Z","abstract_excerpt":"Tensor-network Born machines (TNBMs) are quantum-inspired generative models for learning data distributions. Using tensor-network contraction and optimization techniques, the model learns an efficient representation of the target distribution, capable of capturing complex correlations with a compact parameterization. Despite their promise, the optimization of TNBMs presents several challenges. A key bottleneck of TNBMs is the logarithmic nature of the loss function commonly used for this problem. The single-tensor logarithmic optimization problem cannot be solved analytically, necessitating an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18691","kind":"arxiv","version":2},"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/2501.18691/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":"2501.18691","created_at":"2026-07-05T10:59:05.237987+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18691v2","created_at":"2026-07-05T10:59:05.237987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18691","created_at":"2026-07-05T10:59:05.237987+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDSSKH3JWF7H","created_at":"2026-07-05T10:59:05.237987+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDSSKH3JWF7HN4RZ","created_at":"2026-07-05T10:59:05.237987+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDSSKH3J","created_at":"2026-07-05T10:59:05.237987+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11471","citing_title":"On the Approximation Complexity of Matrix Product Operator Born Machines","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20384","citing_title":"Hessian-vector products for tensor networks via recursive tangent-state propagation","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BDSSKH3JWF7HN4RZHXNX2V5GTM","json":"https://pith.science/pith/BDSSKH3JWF7HN4RZHXNX2V5GTM.json","graph_json":"https://pith.science/api/pith-number/BDSSKH3JWF7HN4RZHXNX2V5GTM/graph.json","events_json":"https://pith.science/api/pith-number/BDSSKH3JWF7HN4RZHXNX2V5GTM/events.json","paper":"https://pith.science/paper/BDSSKH3J"},"agent_actions":{"view_html":"https://pith.science/pith/BDSSKH3JWF7HN4RZHXNX2V5GTM","download_json":"https://pith.science/pith/BDSSKH3JWF7HN4RZHXNX2V5GTM.json","view_paper":"https://pith.science/paper/BDSSKH3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18691&json=true","fetch_graph":"https://pith.science/api/pith-number/BDSSKH3JWF7HN4RZHXNX2V5GTM/graph.json","fetch_events":"https://pith.science/api/pith-number/BDSSKH3JWF7HN4RZHXNX2V5GTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDSSKH3JWF7HN4RZHXNX2V5GTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDSSKH3JWF7HN4RZHXNX2V5GTM/action/storage_attestation","attest_author":"https://pith.science/pith/BDSSKH3JWF7HN4RZHXNX2V5GTM/action/author_attestation","sign_citation":"https://pith.science/pith/BDSSKH3JWF7HN4RZHXNX2V5GTM/action/citation_signature","submit_replication":"https://pith.science/pith/BDSSKH3JWF7HN4RZHXNX2V5GTM/action/replication_record"}},"created_at":"2026-07-05T10:59:05.237987+00:00","updated_at":"2026-07-05T10:59:05.237987+00:00"}