{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WPJVQNULKPJLJTCOCS2JIWTCX5","short_pith_number":"pith:WPJVQNUL","schema_version":"1.0","canonical_sha256":"b3d358368b53d2b4cc4e14b4945a62bf5640c1209350bf9518c8bdca376a8794","source":{"kind":"arxiv","id":"1808.05051","version":1},"attestation_state":"computed","paper":{"title":"Frame-validity games and lower bounds on the complexity of modal axioms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Herzig, David Fern\\'andez-Duque, Petar Iliev, Philippe Balbiani","submitted_at":"2018-08-15T12:16:44Z","abstract_excerpt":"We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols and number of different propositional variables of modal formulae defining a given frame-property. Using these games, we prove lower bounds on the above measures for a number of well-known modal axioms; what is more, for some of the axioms, we show that they are optimal among the formulae defining the respective class of frames."},"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":"1808.05051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-15T12:16:44Z","cross_cats_sorted":[],"title_canon_sha256":"f131c0951d8b56ce40e40a2977415331d9bc89bf4f3f1afb5a99047dfb2a915a","abstract_canon_sha256":"71fb56221e54d46acd0dd48e36b000748a958ec841b9d315ff2470e95df582b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:01.767747Z","signature_b64":"1os4PIsK5aPIqDDWK2e/WoWrc7AdU6yYacqQZNEn/z4IXzawcZDRRsxrOhVQl7JQRxAATuebZPAP80BSJb+RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3d358368b53d2b4cc4e14b4945a62bf5640c1209350bf9518c8bdca376a8794","last_reissued_at":"2026-05-18T00:08:01.767194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:01.767194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frame-validity games and lower bounds on the complexity of modal axioms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Herzig, David Fern\\'andez-Duque, Petar Iliev, Philippe Balbiani","submitted_at":"2018-08-15T12:16:44Z","abstract_excerpt":"We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols and number of different propositional variables of modal formulae defining a given frame-property. Using these games, we prove lower bounds on the above measures for a number of well-known modal axioms; what is more, for some of the axioms, we show that they are optimal among the formulae defining the respective class of frames."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05051","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":"1808.05051","created_at":"2026-05-18T00:08:01.767273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05051v1","created_at":"2026-05-18T00:08:01.767273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05051","created_at":"2026-05-18T00:08:01.767273+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPJVQNULKPJL","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPJVQNULKPJLJTCO","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPJVQNUL","created_at":"2026-05-18T12:33:01.666342+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/WPJVQNULKPJLJTCOCS2JIWTCX5","json":"https://pith.science/pith/WPJVQNULKPJLJTCOCS2JIWTCX5.json","graph_json":"https://pith.science/api/pith-number/WPJVQNULKPJLJTCOCS2JIWTCX5/graph.json","events_json":"https://pith.science/api/pith-number/WPJVQNULKPJLJTCOCS2JIWTCX5/events.json","paper":"https://pith.science/paper/WPJVQNUL"},"agent_actions":{"view_html":"https://pith.science/pith/WPJVQNULKPJLJTCOCS2JIWTCX5","download_json":"https://pith.science/pith/WPJVQNULKPJLJTCOCS2JIWTCX5.json","view_paper":"https://pith.science/paper/WPJVQNUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05051&json=true","fetch_graph":"https://pith.science/api/pith-number/WPJVQNULKPJLJTCOCS2JIWTCX5/graph.json","fetch_events":"https://pith.science/api/pith-number/WPJVQNULKPJLJTCOCS2JIWTCX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPJVQNULKPJLJTCOCS2JIWTCX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPJVQNULKPJLJTCOCS2JIWTCX5/action/storage_attestation","attest_author":"https://pith.science/pith/WPJVQNULKPJLJTCOCS2JIWTCX5/action/author_attestation","sign_citation":"https://pith.science/pith/WPJVQNULKPJLJTCOCS2JIWTCX5/action/citation_signature","submit_replication":"https://pith.science/pith/WPJVQNULKPJLJTCOCS2JIWTCX5/action/replication_record"}},"created_at":"2026-05-18T00:08:01.767273+00:00","updated_at":"2026-05-18T00:08:01.767273+00:00"}