{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RKRBEAIIDKHF7ROMN7L4PRQ7IN","short_pith_number":"pith:RKRBEAII","schema_version":"1.0","canonical_sha256":"8aa21201081a8e5fc5cc6fd7c7c61f4343996acf1b8b43ccbbc16ca361b73cb4","source":{"kind":"arxiv","id":"1511.05931","version":3},"attestation_state":"computed","paper":{"title":"On generalized Van-Benthem-type characterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Grigory Olkhovikov","submitted_at":"2015-11-18T20:22:08Z","abstract_excerpt":"The paper continues the line of model-theoretic characterizations for versions of intuitionistic logic previously achieved by the author, further generalizing them. This results in a model-theoretic characterization of expressive powers of arbitrary finite sets of guarded connectives of degree not exceeding 1 and regular connectives of degree 2 over the language of bounded lattices."},"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":"1511.05931","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-11-18T20:22:08Z","cross_cats_sorted":[],"title_canon_sha256":"5e217091b713e7f28cfafbbdcb3c1964de2459a981d25fb0eab0bb4e5b72425d","abstract_canon_sha256":"771662152616c1b49a24ec9817a512ad053726133ac5b611e5a9330e6fbdd7a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:45.467957Z","signature_b64":"Asa2ZXH2RWAkXR3o2MHKEit6oTuLObYpTy9WSLeCwZPV1vA49Mp1NcQzpRNy22c5wDGuHzgzhDHN1c7YWSZfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aa21201081a8e5fc5cc6fd7c7c61f4343996acf1b8b43ccbbc16ca361b73cb4","last_reissued_at":"2026-05-18T00:24:45.467373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:45.467373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On generalized Van-Benthem-type characterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Grigory Olkhovikov","submitted_at":"2015-11-18T20:22:08Z","abstract_excerpt":"The paper continues the line of model-theoretic characterizations for versions of intuitionistic logic previously achieved by the author, further generalizing them. This results in a model-theoretic characterization of expressive powers of arbitrary finite sets of guarded connectives of degree not exceeding 1 and regular connectives of degree 2 over the language of bounded lattices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05931","kind":"arxiv","version":3},"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":"1511.05931","created_at":"2026-05-18T00:24:45.467487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05931v3","created_at":"2026-05-18T00:24:45.467487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05931","created_at":"2026-05-18T00:24:45.467487+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKRBEAIIDKHF","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKRBEAIIDKHF7ROM","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKRBEAII","created_at":"2026-05-18T12:29:39.896362+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/RKRBEAIIDKHF7ROMN7L4PRQ7IN","json":"https://pith.science/pith/RKRBEAIIDKHF7ROMN7L4PRQ7IN.json","graph_json":"https://pith.science/api/pith-number/RKRBEAIIDKHF7ROMN7L4PRQ7IN/graph.json","events_json":"https://pith.science/api/pith-number/RKRBEAIIDKHF7ROMN7L4PRQ7IN/events.json","paper":"https://pith.science/paper/RKRBEAII"},"agent_actions":{"view_html":"https://pith.science/pith/RKRBEAIIDKHF7ROMN7L4PRQ7IN","download_json":"https://pith.science/pith/RKRBEAIIDKHF7ROMN7L4PRQ7IN.json","view_paper":"https://pith.science/paper/RKRBEAII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05931&json=true","fetch_graph":"https://pith.science/api/pith-number/RKRBEAIIDKHF7ROMN7L4PRQ7IN/graph.json","fetch_events":"https://pith.science/api/pith-number/RKRBEAIIDKHF7ROMN7L4PRQ7IN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKRBEAIIDKHF7ROMN7L4PRQ7IN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKRBEAIIDKHF7ROMN7L4PRQ7IN/action/storage_attestation","attest_author":"https://pith.science/pith/RKRBEAIIDKHF7ROMN7L4PRQ7IN/action/author_attestation","sign_citation":"https://pith.science/pith/RKRBEAIIDKHF7ROMN7L4PRQ7IN/action/citation_signature","submit_replication":"https://pith.science/pith/RKRBEAIIDKHF7ROMN7L4PRQ7IN/action/replication_record"}},"created_at":"2026-05-18T00:24:45.467487+00:00","updated_at":"2026-05-18T00:24:45.467487+00:00"}