{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:US5IBUHS73VY6S3I6FDMCQHIPH","short_pith_number":"pith:US5IBUHS","canonical_record":{"source":{"id":"1201.1119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-05T11:06:38Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ce14b767d70e026108e6cfc555d046bba22d3a4c0afb230e58aa7ae7f524b7e4","abstract_canon_sha256":"3862a2902b5120ad6bf536a706d737a9777588bc2da97e708fd0feb607c18175"},"schema_version":"1.0"},"canonical_sha256":"a4ba80d0f2feeb8f4b68f146c140e879cf0a7aac0e545e6292127b0a6000bc75","source":{"kind":"arxiv","id":"1201.1119","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1119","created_at":"2026-05-18T04:05:06Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1119v1","created_at":"2026-05-18T04:05:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1119","created_at":"2026-05-18T04:05:06Z"},{"alias_kind":"pith_short_12","alias_value":"US5IBUHS73VY","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"US5IBUHS73VY6S3I","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"US5IBUHS","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:US5IBUHS73VY6S3I6FDMCQHIPH","target":"record","payload":{"canonical_record":{"source":{"id":"1201.1119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-05T11:06:38Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ce14b767d70e026108e6cfc555d046bba22d3a4c0afb230e58aa7ae7f524b7e4","abstract_canon_sha256":"3862a2902b5120ad6bf536a706d737a9777588bc2da97e708fd0feb607c18175"},"schema_version":"1.0"},"canonical_sha256":"a4ba80d0f2feeb8f4b68f146c140e879cf0a7aac0e545e6292127b0a6000bc75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:06.094627Z","signature_b64":"6WFpSJy5bzbynYU0zGTEGVH7Q9xCvFVRGxGpDEdDS8KNveuu5qh2/N+n4ocoQd/yM7sHTc0aLc9JutHzEdn0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4ba80d0f2feeb8f4b68f146c140e879cf0a7aac0e545e6292127b0a6000bc75","last_reissued_at":"2026-05-18T04:05:06.093905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:06.093905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.1119","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:05:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3Gl5hyq5RwvtX8TsVoSN4hHTyyBfOz2hC4KogOKJo9aii/sMGzq3C46fnqJREEWAJNEKqvyK2iBC+k/NXz9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:25:09.277351Z"},"content_sha256":"f82882c4fba27bfdbb6b1a8abc81a500d97de0363a0ce277fe8acd085fdb5cfb","schema_version":"1.0","event_id":"sha256:f82882c4fba27bfdbb6b1a8abc81a500d97de0363a0ce277fe8acd085fdb5cfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:US5IBUHS73VY6S3I6FDMCQHIPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implicit complexity for coinductive data: a characterization of corecurrence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Daniel Leivant (Indiana University, LORIA Nancy), Ludwig-Maximilians-Universit\\\"at M\\\"unchen), Ramyaa Ramyaa (Indiana University","submitted_at":"2012-01-05T11:06:38Z","abstract_excerpt":"We propose a framework for reasoning about programs that manipulate coinductive data as well as inductive data.  Our approach is based on using equational programs, which support a seamless combination of computation and reasoning, and using productivity (fairness) as the fundamental assertion, rather than bi-simulation.  The latter is expressible in terms of the former. As an application to this framework, we give an implicit characterization of corecurrence: a function is definable using corecurrence iff its productivity is provable using coinduction for formulas in which data-predicates do "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1119","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:05:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1L0123KCFO+1ri9WKDNwMHZYoSx5Be5IoZ0F3QiqZcuHg+VF9I2/xC+M6K4Bx7OUxBZjxS3bg/Zh8y19WSUrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:25:09.277703Z"},"content_sha256":"623303b436727816ed40172acd6240fc912b5771c9aa76ff3ddfb19a13e95c23","schema_version":"1.0","event_id":"sha256:623303b436727816ed40172acd6240fc912b5771c9aa76ff3ddfb19a13e95c23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH/bundle.json","state_url":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/US5IBUHS73VY6S3I6FDMCQHIPH/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-06-03T11:25:09Z","links":{"resolver":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH","bundle":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH/bundle.json","state":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/US5IBUHS73VY6S3I6FDMCQHIPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:US5IBUHS73VY6S3I6FDMCQHIPH","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":"3862a2902b5120ad6bf536a706d737a9777588bc2da97e708fd0feb607c18175","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-05T11:06:38Z","title_canon_sha256":"ce14b767d70e026108e6cfc555d046bba22d3a4c0afb230e58aa7ae7f524b7e4"},"schema_version":"1.0","source":{"id":"1201.1119","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1119","created_at":"2026-05-18T04:05:06Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1119v1","created_at":"2026-05-18T04:05:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1119","created_at":"2026-05-18T04:05:06Z"},{"alias_kind":"pith_short_12","alias_value":"US5IBUHS73VY","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"US5IBUHS73VY6S3I","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"US5IBUHS","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:623303b436727816ed40172acd6240fc912b5771c9aa76ff3ddfb19a13e95c23","target":"graph","created_at":"2026-05-18T04:05: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"},"paper":{"abstract_excerpt":"We propose a framework for reasoning about programs that manipulate coinductive data as well as inductive data.  Our approach is based on using equational programs, which support a seamless combination of computation and reasoning, and using productivity (fairness) as the fundamental assertion, rather than bi-simulation.  The latter is expressible in terms of the former. As an application to this framework, we give an implicit characterization of corecurrence: a function is definable using corecurrence iff its productivity is provable using coinduction for formulas in which data-predicates do ","authors_text":"Daniel Leivant (Indiana University, LORIA Nancy), Ludwig-Maximilians-Universit\\\"at M\\\"unchen), Ramyaa Ramyaa (Indiana University","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-05T11:06:38Z","title":"Implicit complexity for coinductive data: a characterization of corecurrence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1119","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:f82882c4fba27bfdbb6b1a8abc81a500d97de0363a0ce277fe8acd085fdb5cfb","target":"record","created_at":"2026-05-18T04:05: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":"3862a2902b5120ad6bf536a706d737a9777588bc2da97e708fd0feb607c18175","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-05T11:06:38Z","title_canon_sha256":"ce14b767d70e026108e6cfc555d046bba22d3a4c0afb230e58aa7ae7f524b7e4"},"schema_version":"1.0","source":{"id":"1201.1119","kind":"arxiv","version":1}},"canonical_sha256":"a4ba80d0f2feeb8f4b68f146c140e879cf0a7aac0e545e6292127b0a6000bc75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4ba80d0f2feeb8f4b68f146c140e879cf0a7aac0e545e6292127b0a6000bc75","first_computed_at":"2026-05-18T04:05:06.093905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:06.093905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6WFpSJy5bzbynYU0zGTEGVH7Q9xCvFVRGxGpDEdDS8KNveuu5qh2/N+n4ocoQd/yM7sHTc0aLc9JutHzEdn0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:06.094627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1119","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f82882c4fba27bfdbb6b1a8abc81a500d97de0363a0ce277fe8acd085fdb5cfb","sha256:623303b436727816ed40172acd6240fc912b5771c9aa76ff3ddfb19a13e95c23"],"state_sha256":"7ce412a858ba29f765395cc51cb231b502cda43e9ac4ac9b8caa74cc1c253f87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NiPBUJ3jqxaXEyI/I6RcCGF8e0gR4SalR7j7JG+pbq6ZCEmy+6E0wC/xOnnnEGi+UAIsXdoKJHh43Kc6FIusBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:25:09.279639Z","bundle_sha256":"b84d81163bb76f14a19ac958f94d0c4e469334cd380dcd034704fd6135fdb409"}}