{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:US5IBUHS73VY6S3I6FDMCQHIPH","short_pith_number":"pith:US5IBUHS","schema_version":"1.0","canonical_sha256":"a4ba80d0f2feeb8f4b68f146c140e879cf0a7aac0e545e6292127b0a6000bc75","source":{"kind":"arxiv","id":"1201.1119","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.1119","created_at":"2026-05-18T04:05:06.094004+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1119v1","created_at":"2026-05-18T04:05:06.094004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1119","created_at":"2026-05-18T04:05:06.094004+00:00"},{"alias_kind":"pith_short_12","alias_value":"US5IBUHS73VY","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"US5IBUHS73VY6S3I","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"US5IBUHS","created_at":"2026-05-18T12:27:23.164592+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/US5IBUHS73VY6S3I6FDMCQHIPH","json":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH.json","graph_json":"https://pith.science/api/pith-number/US5IBUHS73VY6S3I6FDMCQHIPH/graph.json","events_json":"https://pith.science/api/pith-number/US5IBUHS73VY6S3I6FDMCQHIPH/events.json","paper":"https://pith.science/paper/US5IBUHS"},"agent_actions":{"view_html":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH","download_json":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH.json","view_paper":"https://pith.science/paper/US5IBUHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1119&json=true","fetch_graph":"https://pith.science/api/pith-number/US5IBUHS73VY6S3I6FDMCQHIPH/graph.json","fetch_events":"https://pith.science/api/pith-number/US5IBUHS73VY6S3I6FDMCQHIPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH/action/storage_attestation","attest_author":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH/action/author_attestation","sign_citation":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH/action/citation_signature","submit_replication":"https://pith.science/pith/US5IBUHS73VY6S3I6FDMCQHIPH/action/replication_record"}},"created_at":"2026-05-18T04:05:06.094004+00:00","updated_at":"2026-05-18T04:05:06.094004+00:00"}