{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PMPLY3QMGHBOE3DEED7JR2FDC3","short_pith_number":"pith:PMPLY3QM","schema_version":"1.0","canonical_sha256":"7b1ebc6e0c31c2e26c6420fe98e8a316e91cd9097cba81f79186611a4f36fc3c","source":{"kind":"arxiv","id":"2408.12778","version":1},"attestation_state":"computed","paper":{"title":"Data-Centric Approach to Constrained Machine Learning: A Case Study on Conway's Game of Life","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.IR"],"primary_cat":"cs.LG","authors_text":"Anton Bibin, Anton Dereventsov","submitted_at":"2024-08-23T00:56:34Z","abstract_excerpt":"This paper focuses on a data-centric approach to machine learning applications in the context of Conway's Game of Life. Specifically, we consider the task of training a minimal architecture network to learn the transition rules of Game of Life for a given number of steps ahead, which is known to be challenging due to restrictions on the allowed number of trainable parameters. An extensive quantitative analysis showcases the benefits of utilizing a strategically designed training dataset, with its advantages persisting regardless of other parameters of the learning configuration, such as networ"},"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":"2408.12778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-23T00:56:34Z","cross_cats_sorted":["cs.AI","cs.CV","cs.IR"],"title_canon_sha256":"eec01baffdb9749f534cf538c9528c2dc08eaecdf071a67859c8b0ac04365ceb","abstract_canon_sha256":"e4d7b3e2cbfd0531872043588dc5eaa1cec38615fd43745d488bd850bf4a4f1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:30.215942Z","signature_b64":"MfiU7PWHJ9nbtcg5GeW0SKGC5oL2Nx9qTCAgqoENizCJDPkeTWZ4xivCimiSaVNCzat8TuQGx7trJWdKZP0NCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b1ebc6e0c31c2e26c6420fe98e8a316e91cd9097cba81f79186611a4f36fc3c","last_reissued_at":"2026-07-05T08:58:30.215473Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:30.215473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Centric Approach to Constrained Machine Learning: A Case Study on Conway's Game of Life","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.IR"],"primary_cat":"cs.LG","authors_text":"Anton Bibin, Anton Dereventsov","submitted_at":"2024-08-23T00:56:34Z","abstract_excerpt":"This paper focuses on a data-centric approach to machine learning applications in the context of Conway's Game of Life. Specifically, we consider the task of training a minimal architecture network to learn the transition rules of Game of Life for a given number of steps ahead, which is known to be challenging due to restrictions on the allowed number of trainable parameters. An extensive quantitative analysis showcases the benefits of utilizing a strategically designed training dataset, with its advantages persisting regardless of other parameters of the learning configuration, such as networ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12778","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/2408.12778/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":"2408.12778","created_at":"2026-07-05T08:58:30.215527+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.12778v1","created_at":"2026-07-05T08:58:30.215527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12778","created_at":"2026-07-05T08:58:30.215527+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMPLY3QMGHBO","created_at":"2026-07-05T08:58:30.215527+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMPLY3QMGHBOE3DE","created_at":"2026-07-05T08:58:30.215527+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMPLY3QM","created_at":"2026-07-05T08:58:30.215527+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.16745","citing_title":"Beyond Memorization: Extending Reasoning Depth with Recurrence, Memory and Test-Time Compute Scaling","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PMPLY3QMGHBOE3DEED7JR2FDC3","json":"https://pith.science/pith/PMPLY3QMGHBOE3DEED7JR2FDC3.json","graph_json":"https://pith.science/api/pith-number/PMPLY3QMGHBOE3DEED7JR2FDC3/graph.json","events_json":"https://pith.science/api/pith-number/PMPLY3QMGHBOE3DEED7JR2FDC3/events.json","paper":"https://pith.science/paper/PMPLY3QM"},"agent_actions":{"view_html":"https://pith.science/pith/PMPLY3QMGHBOE3DEED7JR2FDC3","download_json":"https://pith.science/pith/PMPLY3QMGHBOE3DEED7JR2FDC3.json","view_paper":"https://pith.science/paper/PMPLY3QM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.12778&json=true","fetch_graph":"https://pith.science/api/pith-number/PMPLY3QMGHBOE3DEED7JR2FDC3/graph.json","fetch_events":"https://pith.science/api/pith-number/PMPLY3QMGHBOE3DEED7JR2FDC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMPLY3QMGHBOE3DEED7JR2FDC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMPLY3QMGHBOE3DEED7JR2FDC3/action/storage_attestation","attest_author":"https://pith.science/pith/PMPLY3QMGHBOE3DEED7JR2FDC3/action/author_attestation","sign_citation":"https://pith.science/pith/PMPLY3QMGHBOE3DEED7JR2FDC3/action/citation_signature","submit_replication":"https://pith.science/pith/PMPLY3QMGHBOE3DEED7JR2FDC3/action/replication_record"}},"created_at":"2026-07-05T08:58:30.215527+00:00","updated_at":"2026-07-05T08:58:30.215527+00:00"}