{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RGTUJMDQ7KHVUFPWFRQVVORS2Y","short_pith_number":"pith:RGTUJMDQ","schema_version":"1.0","canonical_sha256":"89a744b070fa8f5a15f62c615aba32d615e76c1df90b2c40808b37caeeee9b33","source":{"kind":"arxiv","id":"2407.14662","version":1},"attestation_state":"computed","paper":{"title":"Relational Composition in Neural Networks: A Survey and Call to Action","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Fernanda B. Vi\\'egas, Martin Wattenberg","submitted_at":"2024-07-19T20:50:57Z","abstract_excerpt":"Many neural nets appear to represent data as linear combinations of \"feature vectors.\" Algorithms for discovering these vectors have seen impressive recent success. However, we argue that this success is incomplete without an understanding of relational composition: how (or whether) neural nets combine feature vectors to represent more complicated relationships. To facilitate research in this area, this paper offers a guided tour of various relational mechanisms that have been proposed, along with preliminary analysis of how such mechanisms might affect the search for interpretable features. W"},"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":"2407.14662","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-19T20:50:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"701138c91451184afade8a10773eb0a5674cc975c4151318bf18bbf7de44564a","abstract_canon_sha256":"0ceeb95f1ceaff53ea5430b2ba0d962ddb11a944a034de9e2299c363fbc5672b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:31.925953Z","signature_b64":"hNqTQhlMZ0MopCehM/FPPda4n1QYRvFLJDhxVsL/xBlvvvFiRZ6AR7SezsPJ9U7yjGiHbKqYGwuE7rA8mmjzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89a744b070fa8f5a15f62c615aba32d615e76c1df90b2c40808b37caeeee9b33","last_reissued_at":"2026-07-05T08:46:31.925546Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:31.925546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relational Composition in Neural Networks: A Survey and Call to Action","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Fernanda B. Vi\\'egas, Martin Wattenberg","submitted_at":"2024-07-19T20:50:57Z","abstract_excerpt":"Many neural nets appear to represent data as linear combinations of \"feature vectors.\" Algorithms for discovering these vectors have seen impressive recent success. However, we argue that this success is incomplete without an understanding of relational composition: how (or whether) neural nets combine feature vectors to represent more complicated relationships. To facilitate research in this area, this paper offers a guided tour of various relational mechanisms that have been proposed, along with preliminary analysis of how such mechanisms might affect the search for interpretable features. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14662","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/2407.14662/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":"2407.14662","created_at":"2026-07-05T08:46:31.925602+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.14662v1","created_at":"2026-07-05T08:46:31.925602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14662","created_at":"2026-07-05T08:46:31.925602+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGTUJMDQ7KHV","created_at":"2026-07-05T08:46:31.925602+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGTUJMDQ7KHVUFPW","created_at":"2026-07-05T08:46:31.925602+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGTUJMDQ","created_at":"2026-07-05T08:46:31.925602+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.18537","citing_title":"Probing for Representation Manifolds in Superposition","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2510.01685","citing_title":"How Do Language Models Compose Functions?","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09967","citing_title":"Tensor Product Representation Probes Reveal Shared Structure Across Linear Directions","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10019","citing_title":"The two clocks and the innovation window: When and how generative models learn rules","ref_index":76,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RGTUJMDQ7KHVUFPWFRQVVORS2Y","json":"https://pith.science/pith/RGTUJMDQ7KHVUFPWFRQVVORS2Y.json","graph_json":"https://pith.science/api/pith-number/RGTUJMDQ7KHVUFPWFRQVVORS2Y/graph.json","events_json":"https://pith.science/api/pith-number/RGTUJMDQ7KHVUFPWFRQVVORS2Y/events.json","paper":"https://pith.science/paper/RGTUJMDQ"},"agent_actions":{"view_html":"https://pith.science/pith/RGTUJMDQ7KHVUFPWFRQVVORS2Y","download_json":"https://pith.science/pith/RGTUJMDQ7KHVUFPWFRQVVORS2Y.json","view_paper":"https://pith.science/paper/RGTUJMDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.14662&json=true","fetch_graph":"https://pith.science/api/pith-number/RGTUJMDQ7KHVUFPWFRQVVORS2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/RGTUJMDQ7KHVUFPWFRQVVORS2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGTUJMDQ7KHVUFPWFRQVVORS2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGTUJMDQ7KHVUFPWFRQVVORS2Y/action/storage_attestation","attest_author":"https://pith.science/pith/RGTUJMDQ7KHVUFPWFRQVVORS2Y/action/author_attestation","sign_citation":"https://pith.science/pith/RGTUJMDQ7KHVUFPWFRQVVORS2Y/action/citation_signature","submit_replication":"https://pith.science/pith/RGTUJMDQ7KHVUFPWFRQVVORS2Y/action/replication_record"}},"created_at":"2026-07-05T08:46:31.925602+00:00","updated_at":"2026-07-05T08:46:31.925602+00:00"}