{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Z7LI4MAYVOLP4PT7SZZ5DHYN4R","short_pith_number":"pith:Z7LI4MAY","schema_version":"1.0","canonical_sha256":"cfd68e3018ab96fe3e7f9673d19f0de44ff4789015f2d49ffc69d97bc83062ad","source":{"kind":"arxiv","id":"1205.0913","version":2},"attestation_state":"computed","paper":{"title":"Pebble games with algebraic rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anuj Dawar, Bjarki Holm","submitted_at":"2012-05-04T10:48:06Z","abstract_excerpt":"We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations of graph isomorphism that is strictly stronger than the well-known Weisfeiler-Lehman method. The general framework we introduce includes as special cases the pebble games for finite-variable logics with and without counting. It also includes a matrix-equivalence game, introduced here, which characterises equivalence in the finite-variable fragments of matri"},"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":"1205.0913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-04T10:48:06Z","cross_cats_sorted":[],"title_canon_sha256":"8fc990573bfe4c49e21c3dcde8f258f051bd6020a7173bd9e3f80c4be70ee343","abstract_canon_sha256":"600d572a98bae7a82b93aa1387194589c7dba932e589715cd9f04baa207d1fc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:15.690632Z","signature_b64":"i8M8SyG4VVrwgDUZMFpzaNRpNYF+Jfip1dq5DMhuYM5iLHOyzwlIHO3xqMess8bI24NtzuU1V6ln00FbAmAkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfd68e3018ab96fe3e7f9673d19f0de44ff4789015f2d49ffc69d97bc83062ad","last_reissued_at":"2026-05-18T02:21:15.689940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:15.689940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pebble games with algebraic rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anuj Dawar, Bjarki Holm","submitted_at":"2012-05-04T10:48:06Z","abstract_excerpt":"We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations of graph isomorphism that is strictly stronger than the well-known Weisfeiler-Lehman method. The general framework we introduce includes as special cases the pebble games for finite-variable logics with and without counting. It also includes a matrix-equivalence game, introduced here, which characterises equivalence in the finite-variable fragments of matri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0913","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":""},"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":"1205.0913","created_at":"2026-05-18T02:21:15.690056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0913v2","created_at":"2026-05-18T02:21:15.690056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0913","created_at":"2026-05-18T02:21:15.690056+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7LI4MAYVOLP","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7LI4MAYVOLP4PT7","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7LI4MAY","created_at":"2026-05-18T12:27:30.460161+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/Z7LI4MAYVOLP4PT7SZZ5DHYN4R","json":"https://pith.science/pith/Z7LI4MAYVOLP4PT7SZZ5DHYN4R.json","graph_json":"https://pith.science/api/pith-number/Z7LI4MAYVOLP4PT7SZZ5DHYN4R/graph.json","events_json":"https://pith.science/api/pith-number/Z7LI4MAYVOLP4PT7SZZ5DHYN4R/events.json","paper":"https://pith.science/paper/Z7LI4MAY"},"agent_actions":{"view_html":"https://pith.science/pith/Z7LI4MAYVOLP4PT7SZZ5DHYN4R","download_json":"https://pith.science/pith/Z7LI4MAYVOLP4PT7SZZ5DHYN4R.json","view_paper":"https://pith.science/paper/Z7LI4MAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0913&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7LI4MAYVOLP4PT7SZZ5DHYN4R/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7LI4MAYVOLP4PT7SZZ5DHYN4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7LI4MAYVOLP4PT7SZZ5DHYN4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7LI4MAYVOLP4PT7SZZ5DHYN4R/action/storage_attestation","attest_author":"https://pith.science/pith/Z7LI4MAYVOLP4PT7SZZ5DHYN4R/action/author_attestation","sign_citation":"https://pith.science/pith/Z7LI4MAYVOLP4PT7SZZ5DHYN4R/action/citation_signature","submit_replication":"https://pith.science/pith/Z7LI4MAYVOLP4PT7SZZ5DHYN4R/action/replication_record"}},"created_at":"2026-05-18T02:21:15.690056+00:00","updated_at":"2026-05-18T02:21:15.690056+00:00"}