{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CRLSJMBS23RARLDBP2XEDTGDEO","short_pith_number":"pith:CRLSJMBS","schema_version":"1.0","canonical_sha256":"145724b032d6e208ac617eae41ccc323a635485f192082a2f8f478e1fc7717b1","source":{"kind":"arxiv","id":"2405.14606","version":4},"attestation_state":"computed","paper":{"title":"Logical Characterizations of Recurrent Graph Neural Networks with Reals and Floats","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Antti Kuusisto, Carsten Lutz, Damian Heiman, Veeti Ahvonen","submitted_at":"2024-05-23T14:19:21Z","abstract_excerpt":"In pioneering work from 2019, Barcel\\'o and coauthors identified logics that precisely match the expressive power of constant iteration-depth graph neural networks (GNNs) relative to properties definable in first-order logic. In this article, we give exact logical characterizations of recurrent GNNs in two scenarios: (1) in the setting with floating-point numbers and (2) with reals. For floats, the formalism matching recurrent GNNs is a rule-based modal logic with counting, while for reals we use a suitable infinitary modal logic, also with counting. These results give exact matches between lo"},"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":"2405.14606","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-05-23T14:19:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a6e4eab484814694df4cc8d768b82b23c316d6c5146554b1034afdca1a5bd2a5","abstract_canon_sha256":"45086dbc332540ffe77849c0b09dec145b4ab5c79b0f03a2d5065da3744b9306"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:57:27.209735Z","signature_b64":"vOeJSBr5kDqSH2KR+mOtADV5rGu98FoYzFdE9xR/Hq/iixSTo9qIYiS4igmX35/jPtQlHlcnolpMqIcazHeRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"145724b032d6e208ac617eae41ccc323a635485f192082a2f8f478e1fc7717b1","last_reissued_at":"2026-07-05T10:57:27.209245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:57:27.209245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logical Characterizations of Recurrent Graph Neural Networks with Reals and Floats","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Antti Kuusisto, Carsten Lutz, Damian Heiman, Veeti Ahvonen","submitted_at":"2024-05-23T14:19:21Z","abstract_excerpt":"In pioneering work from 2019, Barcel\\'o and coauthors identified logics that precisely match the expressive power of constant iteration-depth graph neural networks (GNNs) relative to properties definable in first-order logic. In this article, we give exact logical characterizations of recurrent GNNs in two scenarios: (1) in the setting with floating-point numbers and (2) with reals. For floats, the formalism matching recurrent GNNs is a rule-based modal logic with counting, while for reals we use a suitable infinitary modal logic, also with counting. These results give exact matches between lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14606","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.14606/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":"2405.14606","created_at":"2026-07-05T10:57:27.209302+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.14606v4","created_at":"2026-07-05T10:57:27.209302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14606","created_at":"2026-07-05T10:57:27.209302+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRLSJMBS23RA","created_at":"2026-07-05T10:57:27.209302+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRLSJMBS23RARLDB","created_at":"2026-07-05T10:57:27.209302+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRLSJMBS","created_at":"2026-07-05T10:57:27.209302+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.06091","citing_title":"Aggregate-Combine-Readout GNNs Are More Expressive Than Logic C2","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CRLSJMBS23RARLDBP2XEDTGDEO","json":"https://pith.science/pith/CRLSJMBS23RARLDBP2XEDTGDEO.json","graph_json":"https://pith.science/api/pith-number/CRLSJMBS23RARLDBP2XEDTGDEO/graph.json","events_json":"https://pith.science/api/pith-number/CRLSJMBS23RARLDBP2XEDTGDEO/events.json","paper":"https://pith.science/paper/CRLSJMBS"},"agent_actions":{"view_html":"https://pith.science/pith/CRLSJMBS23RARLDBP2XEDTGDEO","download_json":"https://pith.science/pith/CRLSJMBS23RARLDBP2XEDTGDEO.json","view_paper":"https://pith.science/paper/CRLSJMBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.14606&json=true","fetch_graph":"https://pith.science/api/pith-number/CRLSJMBS23RARLDBP2XEDTGDEO/graph.json","fetch_events":"https://pith.science/api/pith-number/CRLSJMBS23RARLDBP2XEDTGDEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRLSJMBS23RARLDBP2XEDTGDEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRLSJMBS23RARLDBP2XEDTGDEO/action/storage_attestation","attest_author":"https://pith.science/pith/CRLSJMBS23RARLDBP2XEDTGDEO/action/author_attestation","sign_citation":"https://pith.science/pith/CRLSJMBS23RARLDBP2XEDTGDEO/action/citation_signature","submit_replication":"https://pith.science/pith/CRLSJMBS23RARLDBP2XEDTGDEO/action/replication_record"}},"created_at":"2026-07-05T10:57:27.209302+00:00","updated_at":"2026-07-05T10:57:27.209302+00:00"}