{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IY3VMTKBNFFRP74WPRJ36YGASD","short_pith_number":"pith:IY3VMTKB","schema_version":"1.0","canonical_sha256":"4637564d41694b17ff967c53bf60c090e40224e4179d8d1c4a8e52dc3abb7733","source":{"kind":"arxiv","id":"1811.02835","version":3},"attestation_state":"computed","paper":{"title":"Unification in Matching Logic - Extended Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrei Arusoaie, Dorel Lucanu","submitted_at":"2018-11-07T11:12:44Z","abstract_excerpt":"Matching Logic is a framework for specifying programming language semantics and reasoning about programs. Its formulas are called patterns and are built with variables, symbols, connectives and quantifiers. A pattern is a combination of structural components (term patterns), which must be matched, and constraints (predicate patterns), which must be satisfied. Dealing with more than one structural component in a pattern could be cumbersome because it involves multiple matching operations. A source for getting patterns with many structural components is the conjunction of patterns. Here, we prop"},"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":"1811.02835","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-07T11:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"a87eb208014425b9bad48dff61a2add216ccc10d4ee84e24dd2ed485a1c1efbb","abstract_canon_sha256":"c0ab67078386cbad942cd4ae2074842d53ddc672844291773ddd36c26fc64945"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:39.065275Z","signature_b64":"WxAFGWWubkXBbxoke70cjxj9CsTl8HCBTd5yqKL9OcdlWqGearhpQjqdut/E50wjO5fUEw+agfC/PthXXVmUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4637564d41694b17ff967c53bf60c090e40224e4179d8d1c4a8e52dc3abb7733","last_reissued_at":"2026-05-18T00:00:39.064812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:39.064812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unification in Matching Logic - Extended Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrei Arusoaie, Dorel Lucanu","submitted_at":"2018-11-07T11:12:44Z","abstract_excerpt":"Matching Logic is a framework for specifying programming language semantics and reasoning about programs. Its formulas are called patterns and are built with variables, symbols, connectives and quantifiers. A pattern is a combination of structural components (term patterns), which must be matched, and constraints (predicate patterns), which must be satisfied. Dealing with more than one structural component in a pattern could be cumbersome because it involves multiple matching operations. A source for getting patterns with many structural components is the conjunction of patterns. Here, we prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02835","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":"1811.02835","created_at":"2026-05-18T00:00:39.064892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02835v3","created_at":"2026-05-18T00:00:39.064892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02835","created_at":"2026-05-18T00:00:39.064892+00:00"},{"alias_kind":"pith_short_12","alias_value":"IY3VMTKBNFFR","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IY3VMTKBNFFRP74W","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IY3VMTKB","created_at":"2026-05-18T12:32:31.084164+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/IY3VMTKBNFFRP74WPRJ36YGASD","json":"https://pith.science/pith/IY3VMTKBNFFRP74WPRJ36YGASD.json","graph_json":"https://pith.science/api/pith-number/IY3VMTKBNFFRP74WPRJ36YGASD/graph.json","events_json":"https://pith.science/api/pith-number/IY3VMTKBNFFRP74WPRJ36YGASD/events.json","paper":"https://pith.science/paper/IY3VMTKB"},"agent_actions":{"view_html":"https://pith.science/pith/IY3VMTKBNFFRP74WPRJ36YGASD","download_json":"https://pith.science/pith/IY3VMTKBNFFRP74WPRJ36YGASD.json","view_paper":"https://pith.science/paper/IY3VMTKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02835&json=true","fetch_graph":"https://pith.science/api/pith-number/IY3VMTKBNFFRP74WPRJ36YGASD/graph.json","fetch_events":"https://pith.science/api/pith-number/IY3VMTKBNFFRP74WPRJ36YGASD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IY3VMTKBNFFRP74WPRJ36YGASD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IY3VMTKBNFFRP74WPRJ36YGASD/action/storage_attestation","attest_author":"https://pith.science/pith/IY3VMTKBNFFRP74WPRJ36YGASD/action/author_attestation","sign_citation":"https://pith.science/pith/IY3VMTKBNFFRP74WPRJ36YGASD/action/citation_signature","submit_replication":"https://pith.science/pith/IY3VMTKBNFFRP74WPRJ36YGASD/action/replication_record"}},"created_at":"2026-05-18T00:00:39.064892+00:00","updated_at":"2026-05-18T00:00:39.064892+00:00"}