{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:SJBNCQ7UIA4GHKFVT6ZDXA6NAH","short_pith_number":"pith:SJBNCQ7U","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"},"canonical_sha256":"9242d143f4403863a8b59fb23b83cd01f758db5ad6ffc5bf47e8aaf3442c6829","source":{"kind":"arxiv","id":"cs/0012007","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0012007","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0012007v3","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0012007","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"SJBNCQ7UIA4G","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_16","alias_value":"SJBNCQ7UIA4GHKFV","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_8","alias_value":"SJBNCQ7U","created_at":"2026-07-04T14:24:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:SJBNCQ7UIA4GHKFVT6ZDXA6NAH","target":"record","payload":{"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"},"canonical_sha256":"9242d143f4403863a8b59fb23b83cd01f758db5ad6ffc5bf47e8aaf3442c6829","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"},"source_kind":"arxiv","source_id":"cs/0012007","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lx0HLMIQBUVBcrroOFVSjPP9O4UVjOrbqvjtQj5HtI3pnjBX9vUb6c8MflvmJRTTFeI5x9hjPZDgl40jhub4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:19:03.278370Z"},"content_sha256":"56df534c24e65e6b8a8fc3e030cfb84f67bb6c0730b44fa87086dcb26a22db81","schema_version":"1.0","event_id":"sha256:56df534c24e65e6b8a8fc3e030cfb84f67bb6c0730b44fa87086dcb26a22db81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:SJBNCQ7UIA4GHKFVT6ZDXA6NAH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D66Nbp2bolqIX2wFLgA4LOXMpLAN/n8TR8lrnn9CSeifXfbboU21dnaQhy2AlJN6KgBbS5l+6DJPcO2wtsEsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:19:03.278756Z"},"content_sha256":"29dff418232bcf058d732cd0cf6ce1fd420d3867e5b3b0c996783f050e671803","schema_version":"1.0","event_id":"sha256:29dff418232bcf058d732cd0cf6ce1fd420d3867e5b3b0c996783f050e671803"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/bundle.json","state_url":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-17T17:19:03Z","links":{"resolver":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH","bundle":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/bundle.json","state":"https://pith.science/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJBNCQ7UIA4GHKFVT6ZDXA6NAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:SJBNCQ7UIA4GHKFVT6ZDXA6NAH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9abfcfaefc0eadc5578d71b3ccb45d6dcb56c07493a6f0efdcf512393a42fa0c","cross_cats_sorted":["cs.PL"],"license":"","primary_cat":"cs.SE","submitted_at":"2000-12-13T08:48:06Z","title_canon_sha256":"789f580a4547cc1271bc7c4c596f1133118551a677a143a732f9f52d4f865f2e"},"schema_version":"1.0","source":{"id":"cs/0012007","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0012007","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0012007v3","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0012007","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"SJBNCQ7UIA4G","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_16","alias_value":"SJBNCQ7UIA4GHKFV","created_at":"2026-07-04T14:24:06Z"},{"alias_kind":"pith_short_8","alias_value":"SJBNCQ7U","created_at":"2026-07-04T14:24:06Z"}],"graph_snapshots":[{"event_id":"sha256:29dff418232bcf058d732cd0cf6ce1fd420d3867e5b3b0c996783f050e671803","target":"graph","created_at":"2026-07-04T14:24:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0012007/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kazunori Ueda, Yasuhiro Ajiro","cross_cats":["cs.PL"],"headline":"","license":"","primary_cat":"cs.SE","submitted_at":"2000-12-13T08:48:06Z","title":"Kima - an Automated Error Correction System for Concurrent Logic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0012007","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:56df534c24e65e6b8a8fc3e030cfb84f67bb6c0730b44fa87086dcb26a22db81","target":"record","created_at":"2026-07-04T14:24:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9abfcfaefc0eadc5578d71b3ccb45d6dcb56c07493a6f0efdcf512393a42fa0c","cross_cats_sorted":["cs.PL"],"license":"","primary_cat":"cs.SE","submitted_at":"2000-12-13T08:48:06Z","title_canon_sha256":"789f580a4547cc1271bc7c4c596f1133118551a677a143a732f9f52d4f865f2e"},"schema_version":"1.0","source":{"id":"cs/0012007","kind":"arxiv","version":3}},"canonical_sha256":"9242d143f4403863a8b59fb23b83cd01f758db5ad6ffc5bf47e8aaf3442c6829","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9242d143f4403863a8b59fb23b83cd01f758db5ad6ffc5bf47e8aaf3442c6829","first_computed_at":"2026-07-04T14:24:06.349912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:06.349912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WAicTI1lcJeH59DhQdOz9avs3ikMWdMe7IxY5GKOHYiwFxFElnj0DfS3GVHAteRhr+IAjVpr+7/Jt5zX7QueBw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:06.350311Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0012007","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56df534c24e65e6b8a8fc3e030cfb84f67bb6c0730b44fa87086dcb26a22db81","sha256:29dff418232bcf058d732cd0cf6ce1fd420d3867e5b3b0c996783f050e671803"],"state_sha256":"442742617a13da5730ab6e49c8cdc1b9d513bdd7dba79fcadbacc24ee53c260b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v33QSwFF3nOotDiWm1WqUPg7e/krzXqXHurRktV72hZ2wxOTCRntxDb7QwLVin8rR5GLtF9PLdPEt39VAgcPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T17:19:03.281781Z","bundle_sha256":"feff411a8449b2d9b3f9312b4415823e63ce6e898dba8229cb0a67f2c6a43612"}}