{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4O36TE6JIB34FD77W7SWN4LJDU","short_pith_number":"pith:4O36TE6J","canonical_record":{"source":{"id":"1203.0835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-03-05T09:07:18Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"fe0946d067638aebac829cc3ca3ec8f0efd290de38745722a5f5d55dcc3814a0","abstract_canon_sha256":"e054b49696c617d169a1c7b800988bbcce40e5d6ec3806bb76601c789ea1000b"},"schema_version":"1.0"},"canonical_sha256":"e3b7e993c94077c28fffb7e566f1691d17fed7e313dd981719a744838f00bfba","source":{"kind":"arxiv","id":"1203.0835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0835","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0835v1","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0835","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"4O36TE6JIB34","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4O36TE6JIB34FD77","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4O36TE6J","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4O36TE6JIB34FD77W7SWN4LJDU","target":"record","payload":{"canonical_record":{"source":{"id":"1203.0835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-03-05T09:07:18Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"fe0946d067638aebac829cc3ca3ec8f0efd290de38745722a5f5d55dcc3814a0","abstract_canon_sha256":"e054b49696c617d169a1c7b800988bbcce40e5d6ec3806bb76601c789ea1000b"},"schema_version":"1.0"},"canonical_sha256":"e3b7e993c94077c28fffb7e566f1691d17fed7e313dd981719a744838f00bfba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:50.428449Z","signature_b64":"twHZgTqONCqDvGuZed9hidKJ+jBCvZ4UvhmZ6sIaKcdrIEyD8Uuquw2WAEAwVscYJK066g8dwzaOhtUMFsfvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3b7e993c94077c28fffb7e566f1691d17fed7e313dd981719a744838f00bfba","last_reissued_at":"2026-05-18T04:00:50.427940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:50.427940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.0835","source_version":1,"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-05-18T04:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"URKbsQqH/SFdFzGGigrIkbdfxYkVzGxQAKllB5HunUXfkDLfgnYpvXnBQyNZIVFl5iMnBZZzWLAKSSdsEytdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:01:29.413132Z"},"content_sha256":"a460f155bf44ffe4640e1f15f24e314d145576383d813fa2be9055cc12543421","schema_version":"1.0","event_id":"sha256:a460f155bf44ffe4640e1f15f24e314d145576383d813fa2be9055cc12543421"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4O36TE6JIB34FD77W7SWN4LJDU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Functional Logic Programming with Generalized Circular Coinduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Ronald de Haan","submitted_at":"2012-03-05T09:07:18Z","abstract_excerpt":"We propose a method to adapt functional logic programming to deal with reasoning on coinductively interpreted programs as well as on inductively interpreted programs. In order to do so, we consider a class of objects interesting for this coinductive interpretation, namely regular terms. We show how the usual data structures can be adapted to capture these objects. We adapt the operational semantics of Curry to interpret programs coinductively. We illustrate this method with several examples that show the working of our method and several cases in which it could be useful. Finally, we suggest h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0835","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"},"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-05-18T04:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pU2tJEJyLPyHspMelMIvdr2LqY6OXI+ZwXv4AIb7fyP5Uml3FGLSTGuxvs77dYoc0YAAaHP2UiWuBaZpAwmeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:01:29.413487Z"},"content_sha256":"43235e1752dbafd5d5f9ad52b6bc402186476a64b344dd714f1a5d35ced9501a","schema_version":"1.0","event_id":"sha256:43235e1752dbafd5d5f9ad52b6bc402186476a64b344dd714f1a5d35ced9501a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4O36TE6JIB34FD77W7SWN4LJDU/bundle.json","state_url":"https://pith.science/pith/4O36TE6JIB34FD77W7SWN4LJDU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4O36TE6JIB34FD77W7SWN4LJDU/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-07-04T11:01:29Z","links":{"resolver":"https://pith.science/pith/4O36TE6JIB34FD77W7SWN4LJDU","bundle":"https://pith.science/pith/4O36TE6JIB34FD77W7SWN4LJDU/bundle.json","state":"https://pith.science/pith/4O36TE6JIB34FD77W7SWN4LJDU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4O36TE6JIB34FD77W7SWN4LJDU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4O36TE6JIB34FD77W7SWN4LJDU","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":"e054b49696c617d169a1c7b800988bbcce40e5d6ec3806bb76601c789ea1000b","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-03-05T09:07:18Z","title_canon_sha256":"fe0946d067638aebac829cc3ca3ec8f0efd290de38745722a5f5d55dcc3814a0"},"schema_version":"1.0","source":{"id":"1203.0835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0835","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0835v1","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0835","created_at":"2026-05-18T04:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"4O36TE6JIB34","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4O36TE6JIB34FD77","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4O36TE6J","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:43235e1752dbafd5d5f9ad52b6bc402186476a64b344dd714f1a5d35ced9501a","target":"graph","created_at":"2026-05-18T04:00:50Z","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"},"paper":{"abstract_excerpt":"We propose a method to adapt functional logic programming to deal with reasoning on coinductively interpreted programs as well as on inductively interpreted programs. In order to do so, we consider a class of objects interesting for this coinductive interpretation, namely regular terms. We show how the usual data structures can be adapted to capture these objects. We adapt the operational semantics of Curry to interpret programs coinductively. We illustrate this method with several examples that show the working of our method and several cases in which it could be useful. Finally, we suggest h","authors_text":"Ronald de Haan","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-03-05T09:07:18Z","title":"Functional Logic Programming with Generalized Circular Coinduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0835","kind":"arxiv","version":1},"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:a460f155bf44ffe4640e1f15f24e314d145576383d813fa2be9055cc12543421","target":"record","created_at":"2026-05-18T04:00:50Z","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":"e054b49696c617d169a1c7b800988bbcce40e5d6ec3806bb76601c789ea1000b","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-03-05T09:07:18Z","title_canon_sha256":"fe0946d067638aebac829cc3ca3ec8f0efd290de38745722a5f5d55dcc3814a0"},"schema_version":"1.0","source":{"id":"1203.0835","kind":"arxiv","version":1}},"canonical_sha256":"e3b7e993c94077c28fffb7e566f1691d17fed7e313dd981719a744838f00bfba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3b7e993c94077c28fffb7e566f1691d17fed7e313dd981719a744838f00bfba","first_computed_at":"2026-05-18T04:00:50.427940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:50.427940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"twHZgTqONCqDvGuZed9hidKJ+jBCvZ4UvhmZ6sIaKcdrIEyD8Uuquw2WAEAwVscYJK066g8dwzaOhtUMFsfvAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:50.428449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a460f155bf44ffe4640e1f15f24e314d145576383d813fa2be9055cc12543421","sha256:43235e1752dbafd5d5f9ad52b6bc402186476a64b344dd714f1a5d35ced9501a"],"state_sha256":"1671117efaffd14c25bd10c2f5669c9c610c1bbcbe9285b2ce916d5c2089e5d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ni2K1QyuSk1M8/7ljffvp+7BuIyzWYvjNjq9YhkX7rCTu/GiLlsw0UMEX5DNfiKaSYqEfgG/oO6Ha8g9thRmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T11:01:29.415286Z","bundle_sha256":"2202794606bd00d53957287ee47b6eb80ff62ae76a653ac3bcbe6c8fcc7988e1"}}