{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A6WC7BRWS2EC7T27H6TO6BORBD","short_pith_number":"pith:A6WC7BRW","schema_version":"1.0","canonical_sha256":"07ac2f863696882fcf5f3fa6ef05d108f50a997c76c283161d8135069e983860","source":{"kind":"arxiv","id":"1601.00584","version":3},"attestation_state":"computed","paper":{"title":"A Single-Assignment Translation for Annotated Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Cl\\'audio Belo Louren\\c{c}o, Jorge Sousa Pinto, Maria Jo\\~ao Frade","submitted_at":"2016-01-04T17:45:43Z","abstract_excerpt":"We present a translation of While programs annotated with loop invariants into a dynamic single-assignment language with a dedicated iterating construct. We prove that the translation is sound and complete. This is a companion report to our paper Formalizing Single-assignment Program Verification: an Adaptation-complete Approach [6]."},"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":"1601.00584","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-01-04T17:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"11f3f4de687daec1d2bd4a4a5e4044c03665728c8c4161d53489aba3e64b1267","abstract_canon_sha256":"513438432b82ddce4be22ec41b1b83c430acda447a5cb029c27b4a091a41fd41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:35.933413Z","signature_b64":"Nn24qSfXrtpRe2HATN/ZdryfG26XjY4jkIvbni7HeO4XiGI9qJgE19e2pVZ5dTFwrJsDkkhj3OxJdwETrEieBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07ac2f863696882fcf5f3fa6ef05d108f50a997c76c283161d8135069e983860","last_reissued_at":"2026-05-18T01:15:35.932635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:35.932635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Single-Assignment Translation for Annotated Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Cl\\'audio Belo Louren\\c{c}o, Jorge Sousa Pinto, Maria Jo\\~ao Frade","submitted_at":"2016-01-04T17:45:43Z","abstract_excerpt":"We present a translation of While programs annotated with loop invariants into a dynamic single-assignment language with a dedicated iterating construct. We prove that the translation is sound and complete. This is a companion report to our paper Formalizing Single-assignment Program Verification: an Adaptation-complete Approach [6]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00584","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":""},"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":"1601.00584","created_at":"2026-05-18T01:15:35.932776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00584v3","created_at":"2026-05-18T01:15:35.932776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00584","created_at":"2026-05-18T01:15:35.932776+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6WC7BRWS2EC","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6WC7BRWS2EC7T27","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6WC7BRW","created_at":"2026-05-18T12:30:04.600751+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/A6WC7BRWS2EC7T27H6TO6BORBD","json":"https://pith.science/pith/A6WC7BRWS2EC7T27H6TO6BORBD.json","graph_json":"https://pith.science/api/pith-number/A6WC7BRWS2EC7T27H6TO6BORBD/graph.json","events_json":"https://pith.science/api/pith-number/A6WC7BRWS2EC7T27H6TO6BORBD/events.json","paper":"https://pith.science/paper/A6WC7BRW"},"agent_actions":{"view_html":"https://pith.science/pith/A6WC7BRWS2EC7T27H6TO6BORBD","download_json":"https://pith.science/pith/A6WC7BRWS2EC7T27H6TO6BORBD.json","view_paper":"https://pith.science/paper/A6WC7BRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00584&json=true","fetch_graph":"https://pith.science/api/pith-number/A6WC7BRWS2EC7T27H6TO6BORBD/graph.json","fetch_events":"https://pith.science/api/pith-number/A6WC7BRWS2EC7T27H6TO6BORBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6WC7BRWS2EC7T27H6TO6BORBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6WC7BRWS2EC7T27H6TO6BORBD/action/storage_attestation","attest_author":"https://pith.science/pith/A6WC7BRWS2EC7T27H6TO6BORBD/action/author_attestation","sign_citation":"https://pith.science/pith/A6WC7BRWS2EC7T27H6TO6BORBD/action/citation_signature","submit_replication":"https://pith.science/pith/A6WC7BRWS2EC7T27H6TO6BORBD/action/replication_record"}},"created_at":"2026-05-18T01:15:35.932776+00:00","updated_at":"2026-05-18T01:15:35.932776+00:00"}