{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7VMDVGEM25SSM5WCS5AOFI5MGS","short_pith_number":"pith:7VMDVGEM","schema_version":"1.0","canonical_sha256":"fd583a988cd7652676c29740e2a3ac34a75249ef496b2e7f3417725e9f0014c7","source":{"kind":"arxiv","id":"1711.08028","version":4},"attestation_state":"computed","paper":{"title":"Recurrent Relational Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ole Winther, Rasmus Berg Palm, Ulrich Paquet","submitted_at":"2017-11-21T20:34:48Z","abstract_excerpt":"This paper is concerned with learning to solve tasks that require a chain of interdependent steps of relational inference, like answering complex questions about the relationships between objects, or solving puzzles where the smaller elements of a solution mutually constrain each other. We introduce the recurrent relational network, a general purpose module that operates on a graph representation of objects. As a generalization of Santoro et al. [2017]'s relational network, it can augment any neural network model with the capacity to do many-step relational reasoning. We achieve state of the a"},"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":"1711.08028","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-21T20:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"da8c3e1351835e9eec383be50c04c993db7ceff9f69205cec7a6fb7ba027a3ec","abstract_canon_sha256":"35eaee39f4633c69dcba9b5396dc868c03040ac79e25106c6871672d54f56557"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:39.407333Z","signature_b64":"asWy7KgwMwEIaC8dsGwMXxLx0elXXbxI9FIsn7mDhqFM2ZxQDmO7PVNvNh4gvDabAUoJpr7aA148Z7qRjUxiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd583a988cd7652676c29740e2a3ac34a75249ef496b2e7f3417725e9f0014c7","last_reissued_at":"2026-05-17T23:59:39.406710Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:39.406710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recurrent Relational Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ole Winther, Rasmus Berg Palm, Ulrich Paquet","submitted_at":"2017-11-21T20:34:48Z","abstract_excerpt":"This paper is concerned with learning to solve tasks that require a chain of interdependent steps of relational inference, like answering complex questions about the relationships between objects, or solving puzzles where the smaller elements of a solution mutually constrain each other. We introduce the recurrent relational network, a general purpose module that operates on a graph representation of objects. As a generalization of Santoro et al. [2017]'s relational network, it can augment any neural network model with the capacity to do many-step relational reasoning. We achieve state of the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08028","kind":"arxiv","version":4},"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":"1711.08028","created_at":"2026-05-17T23:59:39.406808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08028v4","created_at":"2026-05-17T23:59:39.406808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08028","created_at":"2026-05-17T23:59:39.406808+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VMDVGEM25SS","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VMDVGEM25SSM5WC","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VMDVGEM","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7VMDVGEM25SSM5WCS5AOFI5MGS","json":"https://pith.science/pith/7VMDVGEM25SSM5WCS5AOFI5MGS.json","graph_json":"https://pith.science/api/pith-number/7VMDVGEM25SSM5WCS5AOFI5MGS/graph.json","events_json":"https://pith.science/api/pith-number/7VMDVGEM25SSM5WCS5AOFI5MGS/events.json","paper":"https://pith.science/paper/7VMDVGEM"},"agent_actions":{"view_html":"https://pith.science/pith/7VMDVGEM25SSM5WCS5AOFI5MGS","download_json":"https://pith.science/pith/7VMDVGEM25SSM5WCS5AOFI5MGS.json","view_paper":"https://pith.science/paper/7VMDVGEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08028&json=true","fetch_graph":"https://pith.science/api/pith-number/7VMDVGEM25SSM5WCS5AOFI5MGS/graph.json","fetch_events":"https://pith.science/api/pith-number/7VMDVGEM25SSM5WCS5AOFI5MGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VMDVGEM25SSM5WCS5AOFI5MGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VMDVGEM25SSM5WCS5AOFI5MGS/action/storage_attestation","attest_author":"https://pith.science/pith/7VMDVGEM25SSM5WCS5AOFI5MGS/action/author_attestation","sign_citation":"https://pith.science/pith/7VMDVGEM25SSM5WCS5AOFI5MGS/action/citation_signature","submit_replication":"https://pith.science/pith/7VMDVGEM25SSM5WCS5AOFI5MGS/action/replication_record"}},"created_at":"2026-05-17T23:59:39.406808+00:00","updated_at":"2026-05-17T23:59:39.406808+00:00"}