{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MFU5EULLVHLY5SY24HB33X624K","short_pith_number":"pith:MFU5EULL","schema_version":"1.0","canonical_sha256":"6169d2516ba9d78ecb1ae1c3bddfdae29fced6404329d9c39d31cc81a37c8d40","source":{"kind":"arxiv","id":"1709.02167","version":1},"attestation_state":"computed","paper":{"title":"Bilattice Logic Properly Displayed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alessandra Palmigiano, Fei Liang, Giuseppe Greco, Umberto Rivieccio","submitted_at":"2017-09-07T10:11:25Z","abstract_excerpt":"We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we prove soundness, completeness, conservativity, standard subformula property and cut-elimination. Our proposal builds on the product representation of bilattices and applies the guidelines of the multi-type methodology in the design of display calculi."},"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":"1709.02167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-09-07T10:11:25Z","cross_cats_sorted":[],"title_canon_sha256":"c9b5d9aba735a4c158963afc2f18e35401be8da5fdd916a868147c341e346514","abstract_canon_sha256":"f274f802c512580e407ac2d41d6ab6f0686a8820d05d5fc6015e97028c36b3c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:50.005464Z","signature_b64":"OQm6t4cn7gm/QRYJQuZRL0kiT2t4cGATBp5XL8u6iWntON7bs/uUe4XFdaj2cNnj0RLZa/8VVXc67j7jMa8sCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6169d2516ba9d78ecb1ae1c3bddfdae29fced6404329d9c39d31cc81a37c8d40","last_reissued_at":"2026-05-18T00:35:50.004946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:50.004946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bilattice Logic Properly Displayed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alessandra Palmigiano, Fei Liang, Giuseppe Greco, Umberto Rivieccio","submitted_at":"2017-09-07T10:11:25Z","abstract_excerpt":"We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we prove soundness, completeness, conservativity, standard subformula property and cut-elimination. Our proposal builds on the product representation of bilattices and applies the guidelines of the multi-type methodology in the design of display calculi."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02167","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":"1709.02167","created_at":"2026-05-18T00:35:50.005024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02167v1","created_at":"2026-05-18T00:35:50.005024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02167","created_at":"2026-05-18T00:35:50.005024+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFU5EULLVHLY","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFU5EULLVHLY5SY2","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFU5EULL","created_at":"2026-05-18T12:31:31.346846+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/MFU5EULLVHLY5SY24HB33X624K","json":"https://pith.science/pith/MFU5EULLVHLY5SY24HB33X624K.json","graph_json":"https://pith.science/api/pith-number/MFU5EULLVHLY5SY24HB33X624K/graph.json","events_json":"https://pith.science/api/pith-number/MFU5EULLVHLY5SY24HB33X624K/events.json","paper":"https://pith.science/paper/MFU5EULL"},"agent_actions":{"view_html":"https://pith.science/pith/MFU5EULLVHLY5SY24HB33X624K","download_json":"https://pith.science/pith/MFU5EULLVHLY5SY24HB33X624K.json","view_paper":"https://pith.science/paper/MFU5EULL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02167&json=true","fetch_graph":"https://pith.science/api/pith-number/MFU5EULLVHLY5SY24HB33X624K/graph.json","fetch_events":"https://pith.science/api/pith-number/MFU5EULLVHLY5SY24HB33X624K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFU5EULLVHLY5SY24HB33X624K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFU5EULLVHLY5SY24HB33X624K/action/storage_attestation","attest_author":"https://pith.science/pith/MFU5EULLVHLY5SY24HB33X624K/action/author_attestation","sign_citation":"https://pith.science/pith/MFU5EULLVHLY5SY24HB33X624K/action/citation_signature","submit_replication":"https://pith.science/pith/MFU5EULLVHLY5SY24HB33X624K/action/replication_record"}},"created_at":"2026-05-18T00:35:50.005024+00:00","updated_at":"2026-05-18T00:35:50.005024+00:00"}