{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:YKGI2JENIK6Y6HU2AGIGNBNP4P","short_pith_number":"pith:YKGI2JEN","schema_version":"1.0","canonical_sha256":"c28c8d248d42bd8f1e9a01906685afe3d45fd154ff52d7a4dc1a5a910c97a839","source":{"kind":"arxiv","id":"cs/0603080","version":1},"attestation_state":"computed","paper":{"title":"Yet Another Efficient Unification Algorithm","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Alin Suciu","submitted_at":"2006-03-20T20:15:38Z","abstract_excerpt":"The unification algorithm is at the core of the logic programming paradigm, the first unification algorithm being developed by Robinson [5]. More efficient algorithms were developed later [3] and I introduce here yet another efficient unification algorithm centered on a specific data structure, called the Unification Table."},"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":"cs/0603080","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2006-03-20T20:15:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7a70560581a6b106e6803f67d47174f6ed3fb21d855310c17d7d555a2051ac0b","abstract_canon_sha256":"c77458039b750e5a6e8f3ad852e1d15050714aebff69340fc8a50c3f56335cb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:53:52.506638Z","signature_b64":"b1koWKw5krUJ/UnGIP1BzP2N0Xo2Lt4zFEBNJokNhuaXGhhYRirnlsMDZBvx+lZj3LzICUAnVOXePRnedaoMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c28c8d248d42bd8f1e9a01906685afe3d45fd154ff52d7a4dc1a5a910c97a839","last_reissued_at":"2026-07-04T14:53:52.506272Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:53:52.506272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Yet Another Efficient Unification Algorithm","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Alin Suciu","submitted_at":"2006-03-20T20:15:38Z","abstract_excerpt":"The unification algorithm is at the core of the logic programming paradigm, the first unification algorithm being developed by Robinson [5]. More efficient algorithms were developed later [3] and I introduce here yet another efficient unification algorithm centered on a specific data structure, called the Unification Table."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0603080","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/cs/0603080/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":"cs/0603080","created_at":"2026-07-04T14:53:52.506345+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0603080v1","created_at":"2026-07-04T14:53:52.506345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0603080","created_at":"2026-07-04T14:53:52.506345+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKGI2JENIK6Y","created_at":"2026-07-04T14:53:52.506345+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKGI2JENIK6Y6HU2","created_at":"2026-07-04T14:53:52.506345+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKGI2JEN","created_at":"2026-07-04T14:53:52.506345+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/YKGI2JENIK6Y6HU2AGIGNBNP4P","json":"https://pith.science/pith/YKGI2JENIK6Y6HU2AGIGNBNP4P.json","graph_json":"https://pith.science/api/pith-number/YKGI2JENIK6Y6HU2AGIGNBNP4P/graph.json","events_json":"https://pith.science/api/pith-number/YKGI2JENIK6Y6HU2AGIGNBNP4P/events.json","paper":"https://pith.science/paper/YKGI2JEN"},"agent_actions":{"view_html":"https://pith.science/pith/YKGI2JENIK6Y6HU2AGIGNBNP4P","download_json":"https://pith.science/pith/YKGI2JENIK6Y6HU2AGIGNBNP4P.json","view_paper":"https://pith.science/paper/YKGI2JEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0603080&json=true","fetch_graph":"https://pith.science/api/pith-number/YKGI2JENIK6Y6HU2AGIGNBNP4P/graph.json","fetch_events":"https://pith.science/api/pith-number/YKGI2JENIK6Y6HU2AGIGNBNP4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKGI2JENIK6Y6HU2AGIGNBNP4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKGI2JENIK6Y6HU2AGIGNBNP4P/action/storage_attestation","attest_author":"https://pith.science/pith/YKGI2JENIK6Y6HU2AGIGNBNP4P/action/author_attestation","sign_citation":"https://pith.science/pith/YKGI2JENIK6Y6HU2AGIGNBNP4P/action/citation_signature","submit_replication":"https://pith.science/pith/YKGI2JENIK6Y6HU2AGIGNBNP4P/action/replication_record"}},"created_at":"2026-07-04T14:53:52.506345+00:00","updated_at":"2026-07-04T14:53:52.506345+00:00"}