{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QQRB4BJUBMMEX6IGIQ4RAIHB67","short_pith_number":"pith:QQRB4BJU","schema_version":"1.0","canonical_sha256":"84221e05340b184bf90644391020e1f7efdffc45d424514e4931c6e6e9443f2e","source":{"kind":"arxiv","id":"2205.12259","version":1},"attestation_state":"computed","paper":{"title":"Policy Compliance Detection via Expression Tree Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andreas Vlachos, Lambert Mathias, Majid Yazdani, Marzieh Saeidi, Neema Kotonya","submitted_at":"2022-05-24T17:59:31Z","abstract_excerpt":"Policy Compliance Detection (PCD) is a task we encounter when reasoning over texts, e.g. legal frameworks. Previous work to address PCD relies heavily on modeling the task as a special case of Recognizing Textual Entailment. Entailment is applicable to the problem of PCD, however viewing the policy as a single proposition, as opposed to multiple interlinked propositions, yields poor performance and lacks explainability. To address this challenge, more recent proposals for PCD have argued for decomposing policies into expression trees consisting of questions connected with logic operators. Ques"},"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":"2205.12259","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-05-24T17:59:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fb39d6a4c801bc8b14eee6f8adffc86a40a6d5b3a9d4ba38a7e590087eac2ac8","abstract_canon_sha256":"cfe27148e7fe8b619ce6479810839ae192b715e48f368799e68b4414b24cfd55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:12.709625Z","signature_b64":"bUKR3EN/wzavNQlQSIT4uLQZr6M95MILVshrlnAztmK2Vr/sMWa/7+xluLHOT1aSLqyEDIjSNOnseKZ1x5GNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84221e05340b184bf90644391020e1f7efdffc45d424514e4931c6e6e9443f2e","last_reissued_at":"2026-07-05T04:26:12.709267Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:12.709267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Policy Compliance Detection via Expression Tree Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andreas Vlachos, Lambert Mathias, Majid Yazdani, Marzieh Saeidi, Neema Kotonya","submitted_at":"2022-05-24T17:59:31Z","abstract_excerpt":"Policy Compliance Detection (PCD) is a task we encounter when reasoning over texts, e.g. legal frameworks. Previous work to address PCD relies heavily on modeling the task as a special case of Recognizing Textual Entailment. Entailment is applicable to the problem of PCD, however viewing the policy as a single proposition, as opposed to multiple interlinked propositions, yields poor performance and lacks explainability. To address this challenge, more recent proposals for PCD have argued for decomposing policies into expression trees consisting of questions connected with logic operators. Ques"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12259","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.12259/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2205.12259","created_at":"2026-07-05T04:26:12.709324+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.12259v1","created_at":"2026-07-05T04:26:12.709324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12259","created_at":"2026-07-05T04:26:12.709324+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQRB4BJUBMME","created_at":"2026-07-05T04:26:12.709324+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQRB4BJUBMMEX6IG","created_at":"2026-07-05T04:26:12.709324+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQRB4BJU","created_at":"2026-07-05T04:26:12.709324+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/QQRB4BJUBMMEX6IGIQ4RAIHB67","json":"https://pith.science/pith/QQRB4BJUBMMEX6IGIQ4RAIHB67.json","graph_json":"https://pith.science/api/pith-number/QQRB4BJUBMMEX6IGIQ4RAIHB67/graph.json","events_json":"https://pith.science/api/pith-number/QQRB4BJUBMMEX6IGIQ4RAIHB67/events.json","paper":"https://pith.science/paper/QQRB4BJU"},"agent_actions":{"view_html":"https://pith.science/pith/QQRB4BJUBMMEX6IGIQ4RAIHB67","download_json":"https://pith.science/pith/QQRB4BJUBMMEX6IGIQ4RAIHB67.json","view_paper":"https://pith.science/paper/QQRB4BJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.12259&json=true","fetch_graph":"https://pith.science/api/pith-number/QQRB4BJUBMMEX6IGIQ4RAIHB67/graph.json","fetch_events":"https://pith.science/api/pith-number/QQRB4BJUBMMEX6IGIQ4RAIHB67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQRB4BJUBMMEX6IGIQ4RAIHB67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQRB4BJUBMMEX6IGIQ4RAIHB67/action/storage_attestation","attest_author":"https://pith.science/pith/QQRB4BJUBMMEX6IGIQ4RAIHB67/action/author_attestation","sign_citation":"https://pith.science/pith/QQRB4BJUBMMEX6IGIQ4RAIHB67/action/citation_signature","submit_replication":"https://pith.science/pith/QQRB4BJUBMMEX6IGIQ4RAIHB67/action/replication_record"}},"created_at":"2026-07-05T04:26:12.709324+00:00","updated_at":"2026-07-05T04:26:12.709324+00:00"}