{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MLKDXFPVNWQLZAKGS24QFPLJS5","short_pith_number":"pith:MLKDXFPV","schema_version":"1.0","canonical_sha256":"62d43b95f56da0bc814696b902bd6997651c1f65cb5e2f7671ce1dba6828293b","source":{"kind":"arxiv","id":"1210.1611","version":1},"attestation_state":"computed","paper":{"title":"Efficient Tabling of Structured Data with Enhanced Hash-Consing","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Christian Theil Have, Neng-Fa Zhou","submitted_at":"2012-10-04T23:19:16Z","abstract_excerpt":"Current tabling systems suffer from an increase in space complexity, time complexity or both when dealing with sequences due to the use of data structures for tabled subgoals and answers and the need to copy terms into and from the table area. This symptom can be seen in not only B-Prolog, which uses hash tables, but also systems that use tries such as XSB and YAP. In this paper, we apply hash-consing to tabling structured data in B-Prolog. While hash-consing can reduce the space consumption when sharing is effective, it does not change the time complexity. We enhance hash-consing with two tec"},"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":"1210.1611","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.PL","submitted_at":"2012-10-04T23:19:16Z","cross_cats_sorted":[],"title_canon_sha256":"6c124bb3055f17fedef47948252b0e7b75cbf25054521763b7a10bda17475643","abstract_canon_sha256":"44acd77c38b4dee0bc9fc9fc616dfae5b3553434f6aabe940e9dff8c487f4c04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:01.850140Z","signature_b64":"iVIRyD9ZaK1P3NeJTcc/gabsBKjwyefJXGHTdqNex+3xtPJ5TqIOq0nFSzkfOnAKzQM+BXPY0fQW1d3tokI8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62d43b95f56da0bc814696b902bd6997651c1f65cb5e2f7671ce1dba6828293b","last_reissued_at":"2026-05-18T03:44:01.849438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:01.849438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Tabling of Structured Data with Enhanced Hash-Consing","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Christian Theil Have, Neng-Fa Zhou","submitted_at":"2012-10-04T23:19:16Z","abstract_excerpt":"Current tabling systems suffer from an increase in space complexity, time complexity or both when dealing with sequences due to the use of data structures for tabled subgoals and answers and the need to copy terms into and from the table area. This symptom can be seen in not only B-Prolog, which uses hash tables, but also systems that use tries such as XSB and YAP. In this paper, we apply hash-consing to tabling structured data in B-Prolog. While hash-consing can reduce the space consumption when sharing is effective, it does not change the time complexity. We enhance hash-consing with two tec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1611","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":"1210.1611","created_at":"2026-05-18T03:44:01.849551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.1611v1","created_at":"2026-05-18T03:44:01.849551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1611","created_at":"2026-05-18T03:44:01.849551+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLKDXFPVNWQL","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLKDXFPVNWQLZAKG","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLKDXFPV","created_at":"2026-05-18T12:27:14.488303+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/MLKDXFPVNWQLZAKGS24QFPLJS5","json":"https://pith.science/pith/MLKDXFPVNWQLZAKGS24QFPLJS5.json","graph_json":"https://pith.science/api/pith-number/MLKDXFPVNWQLZAKGS24QFPLJS5/graph.json","events_json":"https://pith.science/api/pith-number/MLKDXFPVNWQLZAKGS24QFPLJS5/events.json","paper":"https://pith.science/paper/MLKDXFPV"},"agent_actions":{"view_html":"https://pith.science/pith/MLKDXFPVNWQLZAKGS24QFPLJS5","download_json":"https://pith.science/pith/MLKDXFPVNWQLZAKGS24QFPLJS5.json","view_paper":"https://pith.science/paper/MLKDXFPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.1611&json=true","fetch_graph":"https://pith.science/api/pith-number/MLKDXFPVNWQLZAKGS24QFPLJS5/graph.json","fetch_events":"https://pith.science/api/pith-number/MLKDXFPVNWQLZAKGS24QFPLJS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLKDXFPVNWQLZAKGS24QFPLJS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLKDXFPVNWQLZAKGS24QFPLJS5/action/storage_attestation","attest_author":"https://pith.science/pith/MLKDXFPVNWQLZAKGS24QFPLJS5/action/author_attestation","sign_citation":"https://pith.science/pith/MLKDXFPVNWQLZAKGS24QFPLJS5/action/citation_signature","submit_replication":"https://pith.science/pith/MLKDXFPVNWQLZAKGS24QFPLJS5/action/replication_record"}},"created_at":"2026-05-18T03:44:01.849551+00:00","updated_at":"2026-05-18T03:44:01.849551+00:00"}