{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JMDICY47SPST37QOKIK7S5HUBY","short_pith_number":"pith:JMDICY47","schema_version":"1.0","canonical_sha256":"4b0681639f93e53dfe0e5215f974f40e1c6933b7c20c8b30d7b62947048dec24","source":{"kind":"arxiv","id":"1402.7105","version":1},"attestation_state":"computed","paper":{"title":"Fool's Solitaire on Joins and Cartesian Products of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jennifer Wise, Sarah Loeb","submitted_at":"2014-02-27T23:09:18Z","abstract_excerpt":"Peg solitaire is a game generalized to connected graphs by Beeler and Hoilman. In the game pegs are placed on all but one vertex. If $xyz$ form a 3-vertex path and $x$ and $y$ each have a peg but $z$ does not, then we can remove the pegs at $x$ and $y$ and place a peg at $z$. By analogy with the moves in the original game, this is called a jump. The goal of the peg solitaire game on graphs is to find jumps that reduce the number of pegs on the graph to 1.\n  Beeler and Rodriguez proposed a variant where we instead want to maximize the number of pegs remaining when no more jumps can be made. Max"},"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":"1402.7105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-27T23:09:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4eb5dd97bd95e93b1f716775418ffcc07e3815c664bfa75ec2e48f0c390b6ff7","abstract_canon_sha256":"6264b4ee8be83447fd068351f33caafe5a2b1e0cde71eb37be0ad70b38971265"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:35.036410Z","signature_b64":"y+qn2OtHcJWOiKs5TqWtWsrD544u58Td6BiGE9DjDsZxJs1MJD0azdtpU6KnWL5hFBp8KQzgu5xrlQIjkNmVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b0681639f93e53dfe0e5215f974f40e1c6933b7c20c8b30d7b62947048dec24","last_reissued_at":"2026-05-18T02:57:35.035835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:35.035835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fool's Solitaire on Joins and Cartesian Products of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jennifer Wise, Sarah Loeb","submitted_at":"2014-02-27T23:09:18Z","abstract_excerpt":"Peg solitaire is a game generalized to connected graphs by Beeler and Hoilman. In the game pegs are placed on all but one vertex. If $xyz$ form a 3-vertex path and $x$ and $y$ each have a peg but $z$ does not, then we can remove the pegs at $x$ and $y$ and place a peg at $z$. By analogy with the moves in the original game, this is called a jump. The goal of the peg solitaire game on graphs is to find jumps that reduce the number of pegs on the graph to 1.\n  Beeler and Rodriguez proposed a variant where we instead want to maximize the number of pegs remaining when no more jumps can be made. Max"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7105","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":""},"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":"1402.7105","created_at":"2026-05-18T02:57:35.035933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7105v1","created_at":"2026-05-18T02:57:35.035933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7105","created_at":"2026-05-18T02:57:35.035933+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMDICY47SPST","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMDICY47SPST37QO","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMDICY47","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JMDICY47SPST37QOKIK7S5HUBY","json":"https://pith.science/pith/JMDICY47SPST37QOKIK7S5HUBY.json","graph_json":"https://pith.science/api/pith-number/JMDICY47SPST37QOKIK7S5HUBY/graph.json","events_json":"https://pith.science/api/pith-number/JMDICY47SPST37QOKIK7S5HUBY/events.json","paper":"https://pith.science/paper/JMDICY47"},"agent_actions":{"view_html":"https://pith.science/pith/JMDICY47SPST37QOKIK7S5HUBY","download_json":"https://pith.science/pith/JMDICY47SPST37QOKIK7S5HUBY.json","view_paper":"https://pith.science/paper/JMDICY47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7105&json=true","fetch_graph":"https://pith.science/api/pith-number/JMDICY47SPST37QOKIK7S5HUBY/graph.json","fetch_events":"https://pith.science/api/pith-number/JMDICY47SPST37QOKIK7S5HUBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMDICY47SPST37QOKIK7S5HUBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMDICY47SPST37QOKIK7S5HUBY/action/storage_attestation","attest_author":"https://pith.science/pith/JMDICY47SPST37QOKIK7S5HUBY/action/author_attestation","sign_citation":"https://pith.science/pith/JMDICY47SPST37QOKIK7S5HUBY/action/citation_signature","submit_replication":"https://pith.science/pith/JMDICY47SPST37QOKIK7S5HUBY/action/replication_record"}},"created_at":"2026-05-18T02:57:35.035933+00:00","updated_at":"2026-05-18T02:57:35.035933+00:00"}