{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:C3DLP7PNE4IDCXJHUJATAJKTB2","short_pith_number":"pith:C3DLP7PN","schema_version":"1.0","canonical_sha256":"16c6b7fded2710315d27a2413025530e83495579438d5b84bab9a873258be1b4","source":{"kind":"arxiv","id":"0912.3510","version":2},"attestation_state":"computed","paper":{"title":"A simple and efficient explicit parallelization of logic programs using low-level threading primitives","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Diptikalyan Saha, Paul Fodor","submitted_at":"2009-12-17T20:32:09Z","abstract_excerpt":"In this work, we present an automatic way to parallelize logic programs for finding all the answers to queries using a transformation to low level threading primitives. Although much work has been done in parallelization of logic programming more than a decade ago (e.g., Aurora, Muse, YapOR), the current state of parallelizing logic programs is still very poor. This work presents a way for parallelism of tabled logic programs in XSB Prolog under the well founded semantics. An important contribution of this work relies in merging answer-tables from multiple children threads without incurring co"},"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":"0912.3510","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.PL","submitted_at":"2009-12-17T20:32:09Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"466cfc99e0b6500f7989ac55e85f7cf0944427df009da10afc29c701bf89db0a","abstract_canon_sha256":"e2d1c0e2777c6a1980c2009a58437d5e7f20c522171e794d568a7a76576bca3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:18:17.260688Z","signature_b64":"a6q8JeS/eAM7ZxmxZXmq538mUVHYqnO4zQOTPLAdDR20J8rxMXK6UD9EveD8UnLOaG6olsN413j9Z0X+j//9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16c6b7fded2710315d27a2413025530e83495579438d5b84bab9a873258be1b4","last_reissued_at":"2026-07-04T17:18:17.260227Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:18:17.260227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple and efficient explicit parallelization of logic programs using low-level threading primitives","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Diptikalyan Saha, Paul Fodor","submitted_at":"2009-12-17T20:32:09Z","abstract_excerpt":"In this work, we present an automatic way to parallelize logic programs for finding all the answers to queries using a transformation to low level threading primitives. Although much work has been done in parallelization of logic programming more than a decade ago (e.g., Aurora, Muse, YapOR), the current state of parallelizing logic programs is still very poor. This work presents a way for parallelism of tabled logic programs in XSB Prolog under the well founded semantics. An important contribution of this work relies in merging answer-tables from multiple children threads without incurring co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.3510","kind":"arxiv","version":2},"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/0912.3510/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":"0912.3510","created_at":"2026-07-04T17:18:17.260293+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.3510v2","created_at":"2026-07-04T17:18:17.260293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.3510","created_at":"2026-07-04T17:18:17.260293+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3DLP7PNE4ID","created_at":"2026-07-04T17:18:17.260293+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3DLP7PNE4IDCXJH","created_at":"2026-07-04T17:18:17.260293+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3DLP7PN","created_at":"2026-07-04T17:18:17.260293+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/C3DLP7PNE4IDCXJHUJATAJKTB2","json":"https://pith.science/pith/C3DLP7PNE4IDCXJHUJATAJKTB2.json","graph_json":"https://pith.science/api/pith-number/C3DLP7PNE4IDCXJHUJATAJKTB2/graph.json","events_json":"https://pith.science/api/pith-number/C3DLP7PNE4IDCXJHUJATAJKTB2/events.json","paper":"https://pith.science/paper/C3DLP7PN"},"agent_actions":{"view_html":"https://pith.science/pith/C3DLP7PNE4IDCXJHUJATAJKTB2","download_json":"https://pith.science/pith/C3DLP7PNE4IDCXJHUJATAJKTB2.json","view_paper":"https://pith.science/paper/C3DLP7PN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.3510&json=true","fetch_graph":"https://pith.science/api/pith-number/C3DLP7PNE4IDCXJHUJATAJKTB2/graph.json","fetch_events":"https://pith.science/api/pith-number/C3DLP7PNE4IDCXJHUJATAJKTB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3DLP7PNE4IDCXJHUJATAJKTB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3DLP7PNE4IDCXJHUJATAJKTB2/action/storage_attestation","attest_author":"https://pith.science/pith/C3DLP7PNE4IDCXJHUJATAJKTB2/action/author_attestation","sign_citation":"https://pith.science/pith/C3DLP7PNE4IDCXJHUJATAJKTB2/action/citation_signature","submit_replication":"https://pith.science/pith/C3DLP7PNE4IDCXJHUJATAJKTB2/action/replication_record"}},"created_at":"2026-07-04T17:18:17.260293+00:00","updated_at":"2026-07-04T17:18:17.260293+00:00"}