{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TAQJ2ONWCLZ7OORKEAMWM2R2LI","short_pith_number":"pith:TAQJ2ONW","schema_version":"1.0","canonical_sha256":"98209d39b612f3f73a2a2019666a3a5a2b1da8eb6e9b345d885af63e6509fd40","source":{"kind":"arxiv","id":"2606.00812","version":1},"attestation_state":"computed","paper":{"title":"A New Ehrenfeucht-Fra\\\"iss\\'e Game for Dependence Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Joni Puljuj\\\"arvi, Jouko V\\\"a\\\"an\\\"anen","submitted_at":"2026-05-30T16:59:55Z","abstract_excerpt":"We define a new Ehrenfeucht-Fra\\\"iss\\'e game for dependence logic. The previously known rendition of such a game was based on moves that are teams. Since teams can be massive, making team moves may be quite complicated. To remedy this, our new Ehrenfeucht-Fra\\\"iss\\'e game for dependence logic has only moves that consist of single elements, as in the classical Ehrenfeucht-Fra\\\"iss\\'e game of first order logic. A new feature of the game is that a player can declare that their move is made on the basis of certain previous moves only and thereby in a sense independent of other moves. We show that "},"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":"2606.00812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-05-30T16:59:55Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"1a98958632a1bddb157ba0fa9d47779be4bc1d1568d9898f55c245707cc85d60","abstract_canon_sha256":"53c1a972d8b5476b8cc7060a37a778d3f5dd600c90b346d2681053c12a440870"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:06.378495Z","signature_b64":"SaTTc0rV9Io98uq6chcvqZGLhpEqceR0CvuRnIoVG5h1E5u5YJARuzOZ6gIC3VyqwJqRl7qna+el7nfeL3bMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98209d39b612f3f73a2a2019666a3a5a2b1da8eb6e9b345d885af63e6509fd40","last_reissued_at":"2026-06-02T01:04:06.378122Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:06.378122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Ehrenfeucht-Fra\\\"iss\\'e Game for Dependence Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Joni Puljuj\\\"arvi, Jouko V\\\"a\\\"an\\\"anen","submitted_at":"2026-05-30T16:59:55Z","abstract_excerpt":"We define a new Ehrenfeucht-Fra\\\"iss\\'e game for dependence logic. The previously known rendition of such a game was based on moves that are teams. Since teams can be massive, making team moves may be quite complicated. To remedy this, our new Ehrenfeucht-Fra\\\"iss\\'e game for dependence logic has only moves that consist of single elements, as in the classical Ehrenfeucht-Fra\\\"iss\\'e game of first order logic. A new feature of the game is that a player can declare that their move is made on the basis of certain previous moves only and thereby in a sense independent of other moves. We show that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00812","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/2606.00812/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":"2606.00812","created_at":"2026-06-02T01:04:06.378175+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00812v1","created_at":"2026-06-02T01:04:06.378175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00812","created_at":"2026-06-02T01:04:06.378175+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAQJ2ONWCLZ7","created_at":"2026-06-02T01:04:06.378175+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAQJ2ONWCLZ7OORK","created_at":"2026-06-02T01:04:06.378175+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAQJ2ONW","created_at":"2026-06-02T01:04:06.378175+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/TAQJ2ONWCLZ7OORKEAMWM2R2LI","json":"https://pith.science/pith/TAQJ2ONWCLZ7OORKEAMWM2R2LI.json","graph_json":"https://pith.science/api/pith-number/TAQJ2ONWCLZ7OORKEAMWM2R2LI/graph.json","events_json":"https://pith.science/api/pith-number/TAQJ2ONWCLZ7OORKEAMWM2R2LI/events.json","paper":"https://pith.science/paper/TAQJ2ONW"},"agent_actions":{"view_html":"https://pith.science/pith/TAQJ2ONWCLZ7OORKEAMWM2R2LI","download_json":"https://pith.science/pith/TAQJ2ONWCLZ7OORKEAMWM2R2LI.json","view_paper":"https://pith.science/paper/TAQJ2ONW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00812&json=true","fetch_graph":"https://pith.science/api/pith-number/TAQJ2ONWCLZ7OORKEAMWM2R2LI/graph.json","fetch_events":"https://pith.science/api/pith-number/TAQJ2ONWCLZ7OORKEAMWM2R2LI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAQJ2ONWCLZ7OORKEAMWM2R2LI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAQJ2ONWCLZ7OORKEAMWM2R2LI/action/storage_attestation","attest_author":"https://pith.science/pith/TAQJ2ONWCLZ7OORKEAMWM2R2LI/action/author_attestation","sign_citation":"https://pith.science/pith/TAQJ2ONWCLZ7OORKEAMWM2R2LI/action/citation_signature","submit_replication":"https://pith.science/pith/TAQJ2ONWCLZ7OORKEAMWM2R2LI/action/replication_record"}},"created_at":"2026-06-02T01:04:06.378175+00:00","updated_at":"2026-06-02T01:04:06.378175+00:00"}