{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4FK7DXDNPQS76PFM45LLLJCSNV","short_pith_number":"pith:4FK7DXDN","schema_version":"1.0","canonical_sha256":"e155f1dc6d7c25ff3cace756b5a4526d7e5c68f96cc3d342889db862da0f2e33","source":{"kind":"arxiv","id":"2409.07953","version":2},"attestation_state":"computed","paper":{"title":"What is the Relationship between Tensor Factorizations and Circuits (and How Can We Exploit it)?","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Antonio Mari, Antonio Vergari, Cassio de Campos, Erik Quaeghebeur, Gennaro Gala, Gennaro Vessio, Lorenzo Loconte, Robert Peharz","submitted_at":"2024-09-12T11:32:01Z","abstract_excerpt":"This paper establishes a rigorous connection between circuit representations and tensor factorizations, two seemingly distinct yet fundamentally related areas. By connecting these fields, we highlight a series of opportunities that can benefit both communities. Our work generalizes popular tensor factorizations within the circuit language, and unifies various circuit learning algorithms under a single, generalized hierarchical factorization framework. Specifically, we introduce a modular \"Lego block\" approach to build tensorized circuit architectures. This, in turn, allows us to systematically"},"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":"2409.07953","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-12T11:32:01Z","cross_cats_sorted":[],"title_canon_sha256":"5516e2e865424c8d4a8fe22ce3a90fc423167a345d816e7e0c2a15674b263d0f","abstract_canon_sha256":"6cee187e7a98d928e686193335915098c3c995aed0c3b587d83bd1eada9542a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:53.536842Z","signature_b64":"6SmXF99rURSeN1eKTfNb8lVG1rtyIsOoiINhHJHMK1rw4RQC/VX785u5ZXI839gkOUYOu2RQeWaGCwAln929Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e155f1dc6d7c25ff3cace756b5a4526d7e5c68f96cc3d342889db862da0f2e33","last_reissued_at":"2026-07-05T10:08:53.536410Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:53.536410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What is the Relationship between Tensor Factorizations and Circuits (and How Can We Exploit it)?","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Antonio Mari, Antonio Vergari, Cassio de Campos, Erik Quaeghebeur, Gennaro Gala, Gennaro Vessio, Lorenzo Loconte, Robert Peharz","submitted_at":"2024-09-12T11:32:01Z","abstract_excerpt":"This paper establishes a rigorous connection between circuit representations and tensor factorizations, two seemingly distinct yet fundamentally related areas. By connecting these fields, we highlight a series of opportunities that can benefit both communities. Our work generalizes popular tensor factorizations within the circuit language, and unifies various circuit learning algorithms under a single, generalized hierarchical factorization framework. Specifically, we introduce a modular \"Lego block\" approach to build tensorized circuit architectures. This, in turn, allows us to systematically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.07953","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/2409.07953/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":"2409.07953","created_at":"2026-07-05T10:08:53.536470+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.07953v2","created_at":"2026-07-05T10:08:53.536470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.07953","created_at":"2026-07-05T10:08:53.536470+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FK7DXDNPQS7","created_at":"2026-07-05T10:08:53.536470+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FK7DXDNPQS76PFM","created_at":"2026-07-05T10:08:53.536470+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FK7DXDN","created_at":"2026-07-05T10:08:53.536470+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12940","citing_title":"The Expressivity Boundary of Probabilistic Circuits: A Comparison with Large Language Models","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4FK7DXDNPQS76PFM45LLLJCSNV","json":"https://pith.science/pith/4FK7DXDNPQS76PFM45LLLJCSNV.json","graph_json":"https://pith.science/api/pith-number/4FK7DXDNPQS76PFM45LLLJCSNV/graph.json","events_json":"https://pith.science/api/pith-number/4FK7DXDNPQS76PFM45LLLJCSNV/events.json","paper":"https://pith.science/paper/4FK7DXDN"},"agent_actions":{"view_html":"https://pith.science/pith/4FK7DXDNPQS76PFM45LLLJCSNV","download_json":"https://pith.science/pith/4FK7DXDNPQS76PFM45LLLJCSNV.json","view_paper":"https://pith.science/paper/4FK7DXDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.07953&json=true","fetch_graph":"https://pith.science/api/pith-number/4FK7DXDNPQS76PFM45LLLJCSNV/graph.json","fetch_events":"https://pith.science/api/pith-number/4FK7DXDNPQS76PFM45LLLJCSNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FK7DXDNPQS76PFM45LLLJCSNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FK7DXDNPQS76PFM45LLLJCSNV/action/storage_attestation","attest_author":"https://pith.science/pith/4FK7DXDNPQS76PFM45LLLJCSNV/action/author_attestation","sign_citation":"https://pith.science/pith/4FK7DXDNPQS76PFM45LLLJCSNV/action/citation_signature","submit_replication":"https://pith.science/pith/4FK7DXDNPQS76PFM45LLLJCSNV/action/replication_record"}},"created_at":"2026-07-05T10:08:53.536470+00:00","updated_at":"2026-07-05T10:08:53.536470+00:00"}