{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2CTV5QUW2H3B5VTRFBX46VIYJW","short_pith_number":"pith:2CTV5QUW","schema_version":"1.0","canonical_sha256":"d0a75ec296d1f61ed671286fcf55184dbb9e26562045b3fc80cb6620ff5c148f","source":{"kind":"arxiv","id":"2309.12253","version":2},"attestation_state":"computed","paper":{"title":"SALSA-CLRS: A Sparse and Scalable Benchmark for Algorithmic Reasoning","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Florian Gr\\\"otschla, Jo\\\"el Mathys, Julian Minder, Roger Wattenhofer","submitted_at":"2023-09-21T16:57:09Z","abstract_excerpt":"We introduce an extension to the CLRS algorithmic learning benchmark, prioritizing scalability and the utilization of sparse representations. Many algorithms in CLRS require global memory or information exchange, mirrored in its execution model, which constructs fully connected (not sparse) graphs based on the underlying problem. Despite CLRS's aim of assessing how effectively learned algorithms can generalize to larger instances, the existing execution model becomes a significant constraint due to its demanding memory requirements and runtime (hard to scale). However, many important algorithm"},"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":"2309.12253","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-21T16:57:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"53bf75304e6a5fc859017555944078d5c865ba7134c8b9c888a77f5b18ff4680","abstract_canon_sha256":"7e22e172a2dfc45bff87fb1fcc7ef163a8a6ef6b4028ce3328f33cefb9571308"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:17.649407Z","signature_b64":"brrQ0W4XTfnOtll4u+gNxk/Cei1vgLfwsyB+WAh8rQdG/31cwKjaydDYYDP9qjgGvnz5if7EEf2x+A2mdaAaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0a75ec296d1f61ed671286fcf55184dbb9e26562045b3fc80cb6620ff5c148f","last_reissued_at":"2026-07-05T07:14:17.648917Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:17.648917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SALSA-CLRS: A Sparse and Scalable Benchmark for Algorithmic Reasoning","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Florian Gr\\\"otschla, Jo\\\"el Mathys, Julian Minder, Roger Wattenhofer","submitted_at":"2023-09-21T16:57:09Z","abstract_excerpt":"We introduce an extension to the CLRS algorithmic learning benchmark, prioritizing scalability and the utilization of sparse representations. Many algorithms in CLRS require global memory or information exchange, mirrored in its execution model, which constructs fully connected (not sparse) graphs based on the underlying problem. Despite CLRS's aim of assessing how effectively learned algorithms can generalize to larger instances, the existing execution model becomes a significant constraint due to its demanding memory requirements and runtime (hard to scale). However, many important algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.12253","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/2309.12253/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":"2309.12253","created_at":"2026-07-05T07:14:17.648975+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.12253v2","created_at":"2026-07-05T07:14:17.648975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.12253","created_at":"2026-07-05T07:14:17.648975+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CTV5QUW2H3B","created_at":"2026-07-05T07:14:17.648975+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CTV5QUW2H3B5VTR","created_at":"2026-07-05T07:14:17.648975+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CTV5QUW","created_at":"2026-07-05T07:14:17.648975+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.04402","citing_title":"Beyond Interpolation: Extrapolative Reasoning with Reinforcement Learning and Graph Neural Networks","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2CTV5QUW2H3B5VTRFBX46VIYJW","json":"https://pith.science/pith/2CTV5QUW2H3B5VTRFBX46VIYJW.json","graph_json":"https://pith.science/api/pith-number/2CTV5QUW2H3B5VTRFBX46VIYJW/graph.json","events_json":"https://pith.science/api/pith-number/2CTV5QUW2H3B5VTRFBX46VIYJW/events.json","paper":"https://pith.science/paper/2CTV5QUW"},"agent_actions":{"view_html":"https://pith.science/pith/2CTV5QUW2H3B5VTRFBX46VIYJW","download_json":"https://pith.science/pith/2CTV5QUW2H3B5VTRFBX46VIYJW.json","view_paper":"https://pith.science/paper/2CTV5QUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.12253&json=true","fetch_graph":"https://pith.science/api/pith-number/2CTV5QUW2H3B5VTRFBX46VIYJW/graph.json","fetch_events":"https://pith.science/api/pith-number/2CTV5QUW2H3B5VTRFBX46VIYJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CTV5QUW2H3B5VTRFBX46VIYJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CTV5QUW2H3B5VTRFBX46VIYJW/action/storage_attestation","attest_author":"https://pith.science/pith/2CTV5QUW2H3B5VTRFBX46VIYJW/action/author_attestation","sign_citation":"https://pith.science/pith/2CTV5QUW2H3B5VTRFBX46VIYJW/action/citation_signature","submit_replication":"https://pith.science/pith/2CTV5QUW2H3B5VTRFBX46VIYJW/action/replication_record"}},"created_at":"2026-07-05T07:14:17.648975+00:00","updated_at":"2026-07-05T07:14:17.648975+00:00"}