{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RTPIVQFPPPUT3PXA7RFLBDGHTO","short_pith_number":"pith:RTPIVQFP","schema_version":"1.0","canonical_sha256":"8cde8ac0af7be93dbee0fc4ab08cc79b93cfda63311ad61c5dac03c4850492f0","source":{"kind":"arxiv","id":"2506.04892","version":1},"attestation_state":"computed","paper":{"title":"Learning to Plan via Supervised Contrastive Learning and Strategic Interpolation: A Chess Case Study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrew C. Freeman, Andrew Hamara, Greg Hamerly, Pablo Rivas","submitted_at":"2025-06-05T11:19:26Z","abstract_excerpt":"Modern chess engines achieve superhuman performance through deep tree search and regressive evaluation, while human players rely on intuition to select candidate moves followed by a shallow search to validate them. To model this intuition-driven planning process, we train a transformer encoder using supervised contrastive learning to embed board states into a latent space structured by positional evaluation. In this space, distance reflects evaluative similarity, and visualized trajectories display interpretable transitions between game states. We demonstrate that move selection can occur enti"},"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":"2506.04892","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-06-05T11:19:26Z","cross_cats_sorted":[],"title_canon_sha256":"b7953c791f64bf29963c0a739f040a52dea8584add18d65098ac635a0ec8c8c3","abstract_canon_sha256":"bbf6144a29f1b7d3337819d9a2f3fbdb39477936f0e32d8050e12494a40fab56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:38.625416Z","signature_b64":"qwyENpAzOlVoWdF9MgaD6iyMRvZHoP3rBxxAsyOtmonY6KHIcbv1BSACRp164nUCo2eFLNA+8M1hdyXWsL1kAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cde8ac0af7be93dbee0fc4ab08cc79b93cfda63311ad61c5dac03c4850492f0","last_reissued_at":"2026-07-05T11:16:38.624860Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:38.624860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Plan via Supervised Contrastive Learning and Strategic Interpolation: A Chess Case Study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrew C. Freeman, Andrew Hamara, Greg Hamerly, Pablo Rivas","submitted_at":"2025-06-05T11:19:26Z","abstract_excerpt":"Modern chess engines achieve superhuman performance through deep tree search and regressive evaluation, while human players rely on intuition to select candidate moves followed by a shallow search to validate them. To model this intuition-driven planning process, we train a transformer encoder using supervised contrastive learning to embed board states into a latent space structured by positional evaluation. In this space, distance reflects evaluative similarity, and visualized trajectories display interpretable transitions between game states. We demonstrate that move selection can occur enti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04892","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/2506.04892/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":"2506.04892","created_at":"2026-07-05T11:16:38.624919+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04892v1","created_at":"2026-07-05T11:16:38.624919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04892","created_at":"2026-07-05T11:16:38.624919+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTPIVQFPPPUT","created_at":"2026-07-05T11:16:38.624919+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTPIVQFPPPUT3PXA","created_at":"2026-07-05T11:16:38.624919+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTPIVQFP","created_at":"2026-07-05T11:16:38.624919+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11860","citing_title":"RePAIR: Predictive Self-Supervised Representation Learning in Chess","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RTPIVQFPPPUT3PXA7RFLBDGHTO","json":"https://pith.science/pith/RTPIVQFPPPUT3PXA7RFLBDGHTO.json","graph_json":"https://pith.science/api/pith-number/RTPIVQFPPPUT3PXA7RFLBDGHTO/graph.json","events_json":"https://pith.science/api/pith-number/RTPIVQFPPPUT3PXA7RFLBDGHTO/events.json","paper":"https://pith.science/paper/RTPIVQFP"},"agent_actions":{"view_html":"https://pith.science/pith/RTPIVQFPPPUT3PXA7RFLBDGHTO","download_json":"https://pith.science/pith/RTPIVQFPPPUT3PXA7RFLBDGHTO.json","view_paper":"https://pith.science/paper/RTPIVQFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04892&json=true","fetch_graph":"https://pith.science/api/pith-number/RTPIVQFPPPUT3PXA7RFLBDGHTO/graph.json","fetch_events":"https://pith.science/api/pith-number/RTPIVQFPPPUT3PXA7RFLBDGHTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTPIVQFPPPUT3PXA7RFLBDGHTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTPIVQFPPPUT3PXA7RFLBDGHTO/action/storage_attestation","attest_author":"https://pith.science/pith/RTPIVQFPPPUT3PXA7RFLBDGHTO/action/author_attestation","sign_citation":"https://pith.science/pith/RTPIVQFPPPUT3PXA7RFLBDGHTO/action/citation_signature","submit_replication":"https://pith.science/pith/RTPIVQFPPPUT3PXA7RFLBDGHTO/action/replication_record"}},"created_at":"2026-07-05T11:16:38.624919+00:00","updated_at":"2026-07-05T11:16:38.624919+00:00"}