{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4XODYRZCERXJ5NDTP6YXKHFDIO","short_pith_number":"pith:4XODYRZC","canonical_record":{"source":{"id":"2507.05267","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-01T09:33:24Z","cross_cats_sorted":[],"title_canon_sha256":"c4c1f767cafe6e6d7958ddcf8e7721146c3ff158ab3808e31ba96aefcac13f14","abstract_canon_sha256":"21f4d177d7eae77a09e45eafcc0dedc122c6d5b08a488ac1942d1e0f7e1ffc2c"},"schema_version":"1.0"},"canonical_sha256":"e5dc3c4722246e9eb4737fb1751ca34392a2bd4234e4907e318273a216b088b8","source":{"kind":"arxiv","id":"2507.05267","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05267","created_at":"2026-07-05T11:33:27Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05267v1","created_at":"2026-07-05T11:33:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05267","created_at":"2026-07-05T11:33:27Z"},{"alias_kind":"pith_short_12","alias_value":"4XODYRZCERXJ","created_at":"2026-07-05T11:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"4XODYRZCERXJ5NDT","created_at":"2026-07-05T11:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"4XODYRZC","created_at":"2026-07-05T11:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4XODYRZCERXJ5NDTP6YXKHFDIO","target":"record","payload":{"canonical_record":{"source":{"id":"2507.05267","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-01T09:33:24Z","cross_cats_sorted":[],"title_canon_sha256":"c4c1f767cafe6e6d7958ddcf8e7721146c3ff158ab3808e31ba96aefcac13f14","abstract_canon_sha256":"21f4d177d7eae77a09e45eafcc0dedc122c6d5b08a488ac1942d1e0f7e1ffc2c"},"schema_version":"1.0"},"canonical_sha256":"e5dc3c4722246e9eb4737fb1751ca34392a2bd4234e4907e318273a216b088b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:27.319261Z","signature_b64":"28f9b/PFwTudOS4oSQNg7cPjbSXllXcAmPxZDSLtntcfzRqNYmOdU+E5HgRt0D0IMofWW0O7lQ7S3oFsBYLQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5dc3c4722246e9eb4737fb1751ca34392a2bd4234e4907e318273a216b088b8","last_reissued_at":"2026-07-05T11:33:27.318699Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:27.318699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.05267","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:33:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulvIJhkexyM7M/4yVwLWK4S5QUCuBFYivBhvRH+wLaNGMPG52Ekgcd8aKHvVuuRfgsux61Caul1mBkxd6OpkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:00:35.100875Z"},"content_sha256":"6d00c4ff519693f5c4fd2d000dbe262268d8bc0ee197a876edc3704828192dbb","schema_version":"1.0","event_id":"sha256:6d00c4ff519693f5c4fd2d000dbe262268d8bc0ee197a876edc3704828192dbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4XODYRZCERXJ5NDTP6YXKHFDIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strongly Solving $7 \\times 6$ Connect-Four on Consumer Grade Hardware","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Markus B\\\"ock","submitted_at":"2025-07-01T09:33:24Z","abstract_excerpt":"While the game Connect-Four has been solved mathematically and the best move can be effectively computed with search based methods, a strong solution in the form of a look-up table was believed to be infeasible. In this paper, we revisit a symbolic search method based on binary decision diagrams to produce strong solutions. With our efficient implementation we were able to produce a 89.6 GB large look-up table in 47 hours on a single CPU core with 128 GB main memory for the standard $7 \\times 6$ board size. In addition to this win-draw-loss evaluation, we include an alpha-beta search in our op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05267","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/2507.05267/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:33:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rl0jhIR/3QMrWP6L6eJGVoaRIEq+VuBXDk68ygk3h9ESmM0/EZN6kqU2yGFd53BcDt1OxXsT4I+TObHe1BgdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:00:35.101397Z"},"content_sha256":"4197b47fce690e5b607c96a7381a0da3de8b6db4ed3473f452fae62c71aaf755","schema_version":"1.0","event_id":"sha256:4197b47fce690e5b607c96a7381a0da3de8b6db4ed3473f452fae62c71aaf755"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4XODYRZCERXJ5NDTP6YXKHFDIO/bundle.json","state_url":"https://pith.science/pith/4XODYRZCERXJ5NDTP6YXKHFDIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4XODYRZCERXJ5NDTP6YXKHFDIO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T21:00:35Z","links":{"resolver":"https://pith.science/pith/4XODYRZCERXJ5NDTP6YXKHFDIO","bundle":"https://pith.science/pith/4XODYRZCERXJ5NDTP6YXKHFDIO/bundle.json","state":"https://pith.science/pith/4XODYRZCERXJ5NDTP6YXKHFDIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4XODYRZCERXJ5NDTP6YXKHFDIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4XODYRZCERXJ5NDTP6YXKHFDIO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"21f4d177d7eae77a09e45eafcc0dedc122c6d5b08a488ac1942d1e0f7e1ffc2c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-01T09:33:24Z","title_canon_sha256":"c4c1f767cafe6e6d7958ddcf8e7721146c3ff158ab3808e31ba96aefcac13f14"},"schema_version":"1.0","source":{"id":"2507.05267","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05267","created_at":"2026-07-05T11:33:27Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05267v1","created_at":"2026-07-05T11:33:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05267","created_at":"2026-07-05T11:33:27Z"},{"alias_kind":"pith_short_12","alias_value":"4XODYRZCERXJ","created_at":"2026-07-05T11:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"4XODYRZCERXJ5NDT","created_at":"2026-07-05T11:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"4XODYRZC","created_at":"2026-07-05T11:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:4197b47fce690e5b607c96a7381a0da3de8b6db4ed3473f452fae62c71aaf755","target":"graph","created_at":"2026-07-05T11:33:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.05267/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While the game Connect-Four has been solved mathematically and the best move can be effectively computed with search based methods, a strong solution in the form of a look-up table was believed to be infeasible. In this paper, we revisit a symbolic search method based on binary decision diagrams to produce strong solutions. With our efficient implementation we were able to produce a 89.6 GB large look-up table in 47 hours on a single CPU core with 128 GB main memory for the standard $7 \\times 6$ board size. In addition to this win-draw-loss evaluation, we include an alpha-beta search in our op","authors_text":"Markus B\\\"ock","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-01T09:33:24Z","title":"Strongly Solving $7 \\times 6$ Connect-Four on Consumer Grade Hardware"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05267","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6d00c4ff519693f5c4fd2d000dbe262268d8bc0ee197a876edc3704828192dbb","target":"record","created_at":"2026-07-05T11:33:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"21f4d177d7eae77a09e45eafcc0dedc122c6d5b08a488ac1942d1e0f7e1ffc2c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-01T09:33:24Z","title_canon_sha256":"c4c1f767cafe6e6d7958ddcf8e7721146c3ff158ab3808e31ba96aefcac13f14"},"schema_version":"1.0","source":{"id":"2507.05267","kind":"arxiv","version":1}},"canonical_sha256":"e5dc3c4722246e9eb4737fb1751ca34392a2bd4234e4907e318273a216b088b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5dc3c4722246e9eb4737fb1751ca34392a2bd4234e4907e318273a216b088b8","first_computed_at":"2026-07-05T11:33:27.318699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:27.318699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"28f9b/PFwTudOS4oSQNg7cPjbSXllXcAmPxZDSLtntcfzRqNYmOdU+E5HgRt0D0IMofWW0O7lQ7S3oFsBYLQBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:27.319261Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.05267","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d00c4ff519693f5c4fd2d000dbe262268d8bc0ee197a876edc3704828192dbb","sha256:4197b47fce690e5b607c96a7381a0da3de8b6db4ed3473f452fae62c71aaf755"],"state_sha256":"66cf715c43f603a37db7c1a280ae3fd6fc92842fc0a12285b2b6007b4bc3f593"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jTU592gzBBcJC/FCNXao09NwsLTcz5nhTjvMiSF3TW5C5ztEJsxQGyL974f7pWqLO1doYLgRQ1nKxEyxVJ67AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:00:35.109389Z","bundle_sha256":"44c224ccf0a718a0b2a348195e73f7421bac0449dfcb315e70d6477ff50baace"}}