{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:SJBNCQ7UIA4GHKFVT6ZDXA6NAH","short_pith_number":"pith:SJBNCQ7U","schema_version":"1.0","canonical_sha256":"9242d143f4403863a8b59fb23b83cd01f758db5ad6ffc5bf47e8aaf3442c6829","source":{"kind":"arxiv","id":"cs/0012007","version":3},"attestation_state":"computed","paper":{"title":"Kima - an Automated Error Correction System for Concurrent Logic Programs","license":"","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"Kazunori Ueda, Yasuhiro Ajiro","submitted_at":"2000-12-13T08:48:06Z","abstract_excerpt":"We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explicit declarations of program properties. Strong moding/typing and constraint-based analysis are turning to play fundamental roles in debugging concurrent logic programs as well as in establishing the consistency of communication protocols and data types. Mode/type analysis of Moded Flat GHC is a constraint satisfaction problem with many simple mode/type constraints, and can be solved efficiently. We proposed a simple an"},"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/0012007","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.SE","submitted_at":"2000-12-13T08:48:06Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"789f580a4547cc1271bc7c4c596f1133118551a677a143a732f9f52d4f865f2e","abstract_canon_sha256":"9abfcfaefc0eadc5578d71b3ccb45d6dcb56c07493a6f0efdcf512393a42fa0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:06.350311Z","signature_b64":"WAicTI1lcJeH59DhQdOz9avs3ikMWdMe7IxY5GKOHYiwFxFElnj0DfS3GVHAteRhr+IAjVpr+7/Jt5zX7QueBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9242d143f4403863a8b59fb23b83cd01f758db5ad6ffc5bf47e8aaf3442c6829","last_reissued_at":"2026-07-04T14:24:06.349912Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:06.349912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kima - an Automated Error Correction System for Concurrent Logic Programs","license":"","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"Kazunori Ueda, Yasuhiro Ajiro","submitted_at":"2000-12-13T08:48:06Z","abstract_excerpt":"We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explicit declarations of program properties. Strong moding/typing and constraint-based analysis are turning to play fundamental roles in debugging concurrent logic programs as well as in establishing the consistency of communication protocols and data types. Mode/type analysis of Moded Flat GHC is a constraint satisfaction problem with many simple mode/type constraints, and can be solved efficiently. We proposed a simple an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0012007","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0012007/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/0012007","created_at":"2026-07-04T14:24:06.349966+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0012007v3","created_at":"2026-07-04T14:24:06.349966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0012007","created_at":"2026-07-04T14:24:06.349966+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJBNCQ7UIA4G","created_at":"2026-07-04T14:24:06.349966+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJBNCQ7UIA4GHKFV","created_at":"2026-07-04T14:24:06.349966+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJBNCQ7U","created_at":"2026-07-04T14:24:06.349966+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/SJBNCQ7UIA4GHKFVT6ZDXA6NAH","json":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH.json","graph_json":"https://pith.science/api/pith-number/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/graph.json","events_json":"https://pith.science/api/pith-number/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/events.json","paper":"https://pith.science/paper/SJBNCQ7U"},"agent_actions":{"view_html":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH","download_json":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH.json","view_paper":"https://pith.science/paper/SJBNCQ7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0012007&json=true","fetch_graph":"https://pith.science/api/pith-number/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/graph.json","fetch_events":"https://pith.science/api/pith-number/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/action/storage_attestation","attest_author":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/action/author_attestation","sign_citation":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/action/citation_signature","submit_replication":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/action/replication_record"}},"created_at":"2026-07-04T14:24:06.349966+00:00","updated_at":"2026-07-04T14:24:06.349966+00:00"}