{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:352SNQJLXLZTUSOVMD3JE7FO3G","short_pith_number":"pith:352SNQJL","schema_version":"1.0","canonical_sha256":"df7526c12bbaf33a49d560f6927caed995e14716aa1841f8fb8b6d02c73318c1","source":{"kind":"arxiv","id":"1706.02048","version":1},"attestation_state":"computed","paper":{"title":"Epistemic Logic with Functional Dependency Operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Yifeng Ding","submitted_at":"2017-06-07T05:16:54Z","abstract_excerpt":"Epistemic logic with non-standard knowledge operators, especially the \"knowing-value\" operator, has recently gathered much attention. With the \"knowing-value\" operator, we can express knowledge of individual variables, but not of the relations between them in general. In this paper, we propose a new operator Kf to express knowledge of the functional dependencies between variables. The semantics of this Kf operator uses a function domain which imposes a constraint on what counts as a functional dependency relation. By adjusting this function domain, different interesting logics arise, and in th"},"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":"1706.02048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-07T05:16:54Z","cross_cats_sorted":[],"title_canon_sha256":"996ae86b697a57940017b5b9007801c308a11583169c1e006645b4d5dde56c6d","abstract_canon_sha256":"1418c4e297d4f2168be5c04db81ea88a6fe668bfa45adefd97ac74f7d91ed7be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:50.314927Z","signature_b64":"cYSADFdj9Yr9CJ4BkjyjVKJlyiBPpg7KRCSzI2Z/SWoFdXyhQ0c+az2h3sPYX3aI+8977i+Q0U+7KZaBBmzPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df7526c12bbaf33a49d560f6927caed995e14716aa1841f8fb8b6d02c73318c1","last_reissued_at":"2026-05-18T00:42:50.314100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:50.314100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Epistemic Logic with Functional Dependency Operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Yifeng Ding","submitted_at":"2017-06-07T05:16:54Z","abstract_excerpt":"Epistemic logic with non-standard knowledge operators, especially the \"knowing-value\" operator, has recently gathered much attention. With the \"knowing-value\" operator, we can express knowledge of individual variables, but not of the relations between them in general. In this paper, we propose a new operator Kf to express knowledge of the functional dependencies between variables. The semantics of this Kf operator uses a function domain which imposes a constraint on what counts as a functional dependency relation. By adjusting this function domain, different interesting logics arise, and in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02048","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":"1706.02048","created_at":"2026-05-18T00:42:50.314228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02048v1","created_at":"2026-05-18T00:42:50.314228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02048","created_at":"2026-05-18T00:42:50.314228+00:00"},{"alias_kind":"pith_short_12","alias_value":"352SNQJLXLZT","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"352SNQJLXLZTUSOV","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"352SNQJL","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09105","citing_title":"How to Agree without Understanding Each Other: Public Announcement Logic with Boolean Definitions","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/352SNQJLXLZTUSOVMD3JE7FO3G","json":"https://pith.science/pith/352SNQJLXLZTUSOVMD3JE7FO3G.json","graph_json":"https://pith.science/api/pith-number/352SNQJLXLZTUSOVMD3JE7FO3G/graph.json","events_json":"https://pith.science/api/pith-number/352SNQJLXLZTUSOVMD3JE7FO3G/events.json","paper":"https://pith.science/paper/352SNQJL"},"agent_actions":{"view_html":"https://pith.science/pith/352SNQJLXLZTUSOVMD3JE7FO3G","download_json":"https://pith.science/pith/352SNQJLXLZTUSOVMD3JE7FO3G.json","view_paper":"https://pith.science/paper/352SNQJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02048&json=true","fetch_graph":"https://pith.science/api/pith-number/352SNQJLXLZTUSOVMD3JE7FO3G/graph.json","fetch_events":"https://pith.science/api/pith-number/352SNQJLXLZTUSOVMD3JE7FO3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/352SNQJLXLZTUSOVMD3JE7FO3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/352SNQJLXLZTUSOVMD3JE7FO3G/action/storage_attestation","attest_author":"https://pith.science/pith/352SNQJLXLZTUSOVMD3JE7FO3G/action/author_attestation","sign_citation":"https://pith.science/pith/352SNQJLXLZTUSOVMD3JE7FO3G/action/citation_signature","submit_replication":"https://pith.science/pith/352SNQJLXLZTUSOVMD3JE7FO3G/action/replication_record"}},"created_at":"2026-05-18T00:42:50.314228+00:00","updated_at":"2026-05-18T00:42:50.314228+00:00"}