{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OFMO32S3HCC5Z7D22NP3YNKKQG","short_pith_number":"pith:OFMO32S3","schema_version":"1.0","canonical_sha256":"7158edea5b3885dcfc7ad35fbc354a81b6a30ca9dbd785e14f67cfe95b464109","source":{"kind":"arxiv","id":"1204.6236","version":1},"attestation_state":"computed","paper":{"title":"Combining Deduction Modulo and Logics of Fixed-Point Definitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Baelde, Gopalan Nadathur","submitted_at":"2012-04-27T15:05:10Z","abstract_excerpt":"Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of recursive specifications. These specifications are not directly complemented by fixed-point reasoning techniques and, correspondingly, do not have to satisfy strong monotonicity restrictions. We show how to incorporate a rewriting capability into logics of fixed-point definitions towards additionally supporting recursive specifications. In particular, we describe"},"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":"1204.6236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-27T15:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"7bc7e0e9b28c69eaffe1e50815ecb7fabecc79e4ab1826db996f59647f2d502d","abstract_canon_sha256":"956f317d6bc699b0bd9b22b238ac4bec7b3e56086820bb1f7fb1c8fc58c45951"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:46.676776Z","signature_b64":"4colweYgfa1Wi6zpj7yq8Li+pclM3icqwdM+b0GKb0YGMc98S54qQH3SwakymjQV3FzhxS8iScwUvs51XRRkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7158edea5b3885dcfc7ad35fbc354a81b6a30ca9dbd785e14f67cfe95b464109","last_reissued_at":"2026-05-18T03:56:46.676229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:46.676229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combining Deduction Modulo and Logics of Fixed-Point Definitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Baelde, Gopalan Nadathur","submitted_at":"2012-04-27T15:05:10Z","abstract_excerpt":"Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of recursive specifications. These specifications are not directly complemented by fixed-point reasoning techniques and, correspondingly, do not have to satisfy strong monotonicity restrictions. We show how to incorporate a rewriting capability into logics of fixed-point definitions towards additionally supporting recursive specifications. In particular, we describe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6236","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":"1204.6236","created_at":"2026-05-18T03:56:46.676306+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.6236v1","created_at":"2026-05-18T03:56:46.676306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6236","created_at":"2026-05-18T03:56:46.676306+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFMO32S3HCC5","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFMO32S3HCC5Z7D2","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFMO32S3","created_at":"2026-05-18T12:27:16.716162+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/OFMO32S3HCC5Z7D22NP3YNKKQG","json":"https://pith.science/pith/OFMO32S3HCC5Z7D22NP3YNKKQG.json","graph_json":"https://pith.science/api/pith-number/OFMO32S3HCC5Z7D22NP3YNKKQG/graph.json","events_json":"https://pith.science/api/pith-number/OFMO32S3HCC5Z7D22NP3YNKKQG/events.json","paper":"https://pith.science/paper/OFMO32S3"},"agent_actions":{"view_html":"https://pith.science/pith/OFMO32S3HCC5Z7D22NP3YNKKQG","download_json":"https://pith.science/pith/OFMO32S3HCC5Z7D22NP3YNKKQG.json","view_paper":"https://pith.science/paper/OFMO32S3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.6236&json=true","fetch_graph":"https://pith.science/api/pith-number/OFMO32S3HCC5Z7D22NP3YNKKQG/graph.json","fetch_events":"https://pith.science/api/pith-number/OFMO32S3HCC5Z7D22NP3YNKKQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFMO32S3HCC5Z7D22NP3YNKKQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFMO32S3HCC5Z7D22NP3YNKKQG/action/storage_attestation","attest_author":"https://pith.science/pith/OFMO32S3HCC5Z7D22NP3YNKKQG/action/author_attestation","sign_citation":"https://pith.science/pith/OFMO32S3HCC5Z7D22NP3YNKKQG/action/citation_signature","submit_replication":"https://pith.science/pith/OFMO32S3HCC5Z7D22NP3YNKKQG/action/replication_record"}},"created_at":"2026-05-18T03:56:46.676306+00:00","updated_at":"2026-05-18T03:56:46.676306+00:00"}