{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G6ADNKTYUQXV2NMRLCXQRJBQGQ","short_pith_number":"pith:G6ADNKTY","schema_version":"1.0","canonical_sha256":"378036aa78a42f5d359158af08a43034054d57774bee14c4069d7c87c0adf462","source":{"kind":"arxiv","id":"1905.11748","version":2},"attestation_state":"computed","paper":{"title":"Modelling competing theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alessandra Palmigiano, Andrew Craig, Nachoem M. Wijnberg, Willem Conradie","submitted_at":"2019-05-28T11:26:25Z","abstract_excerpt":"We introduce a complete many-valued semantics for two normal lattice-based modal logics. This semantics is based on reflexive many-valued graphs. We discuss an interpretation and possible applications of this logical framework in the context of the formal analysis of the interaction between (competing) scientific theories."},"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":"1905.11748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-05-28T11:26:25Z","cross_cats_sorted":[],"title_canon_sha256":"edfbfaf534a64578d4e6429a14c2af893d62778ce517f142a43fda9606b652bd","abstract_canon_sha256":"4b44cd7dc442268f0549272e232e61157c47e1aa9d481840dcd967236715d835"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:02.162531Z","signature_b64":"OLfJtu8CoEQ695h/R5LpJg/sK0K+8q9YyyHrgE4hdU7iAjmZDuSrCQkazhJO8c947GVk3ODn7NXEqEC5U+BgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"378036aa78a42f5d359158af08a43034054d57774bee14c4069d7c87c0adf462","last_reissued_at":"2026-05-17T23:42:02.161941Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:02.161941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modelling competing theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alessandra Palmigiano, Andrew Craig, Nachoem M. Wijnberg, Willem Conradie","submitted_at":"2019-05-28T11:26:25Z","abstract_excerpt":"We introduce a complete many-valued semantics for two normal lattice-based modal logics. This semantics is based on reflexive many-valued graphs. We discuss an interpretation and possible applications of this logical framework in the context of the formal analysis of the interaction between (competing) scientific theories."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11748","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":"1905.11748","created_at":"2026-05-17T23:42:02.162037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11748v2","created_at":"2026-05-17T23:42:02.162037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11748","created_at":"2026-05-17T23:42:02.162037+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6ADNKTYUQXV","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6ADNKTYUQXV2NMR","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6ADNKTY","created_at":"2026-05-18T12:33:18.533446+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/G6ADNKTYUQXV2NMRLCXQRJBQGQ","json":"https://pith.science/pith/G6ADNKTYUQXV2NMRLCXQRJBQGQ.json","graph_json":"https://pith.science/api/pith-number/G6ADNKTYUQXV2NMRLCXQRJBQGQ/graph.json","events_json":"https://pith.science/api/pith-number/G6ADNKTYUQXV2NMRLCXQRJBQGQ/events.json","paper":"https://pith.science/paper/G6ADNKTY"},"agent_actions":{"view_html":"https://pith.science/pith/G6ADNKTYUQXV2NMRLCXQRJBQGQ","download_json":"https://pith.science/pith/G6ADNKTYUQXV2NMRLCXQRJBQGQ.json","view_paper":"https://pith.science/paper/G6ADNKTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11748&json=true","fetch_graph":"https://pith.science/api/pith-number/G6ADNKTYUQXV2NMRLCXQRJBQGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/G6ADNKTYUQXV2NMRLCXQRJBQGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6ADNKTYUQXV2NMRLCXQRJBQGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6ADNKTYUQXV2NMRLCXQRJBQGQ/action/storage_attestation","attest_author":"https://pith.science/pith/G6ADNKTYUQXV2NMRLCXQRJBQGQ/action/author_attestation","sign_citation":"https://pith.science/pith/G6ADNKTYUQXV2NMRLCXQRJBQGQ/action/citation_signature","submit_replication":"https://pith.science/pith/G6ADNKTYUQXV2NMRLCXQRJBQGQ/action/replication_record"}},"created_at":"2026-05-17T23:42:02.162037+00:00","updated_at":"2026-05-17T23:42:02.162037+00:00"}