{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TE3S5TQDH74Y3UIPFYJF666FI4","short_pith_number":"pith:TE3S5TQD","schema_version":"1.0","canonical_sha256":"99372ece033ff98dd10f2e125f7bc5471abed650051712b9ea1e6c8d9b6ab5b0","source":{"kind":"arxiv","id":"1108.0190","version":1},"attestation_state":"computed","paper":{"title":"On the Correctness of Pull-Tabbing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Sergio Antoy","submitted_at":"2011-07-31T18:01:14Z","abstract_excerpt":"Pull-tabbing is an evaluation approach for functional logic computations, based on a graph transformation recently proposed, which avoids making irrevocable non-deterministic choices that would jeopardize the completeness of computations. In contrast to other approaches with this property, it does not require an upfront cloning of a possibly large portion of the choice's context. We formally define the pull-tab transformation, characterize the class of programs for which the transformation is intended, extend the computations in these programs to include the transformation, and prove the corre"},"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":"1108.0190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-07-31T18:01:14Z","cross_cats_sorted":[],"title_canon_sha256":"0a610bbd17a8f90aff532714f64281e92af106a4b7b687fab1d3c4943b077cdd","abstract_canon_sha256":"314f817938348bfbc62fea3bded89559799fc5cdcf728108e5e7973f10fbbd4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:31.546634Z","signature_b64":"V8JyhT544Np+CeCp+JgrRm5ee2nlW2qF0Ox8ZhcNLUvLYAwK9r7OpNaEHoZE9eRJ9FYpgnX7TYT/GnLDiipoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99372ece033ff98dd10f2e125f7bc5471abed650051712b9ea1e6c8d9b6ab5b0","last_reissued_at":"2026-05-18T04:16:31.546247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:31.546247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Correctness of Pull-Tabbing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Sergio Antoy","submitted_at":"2011-07-31T18:01:14Z","abstract_excerpt":"Pull-tabbing is an evaluation approach for functional logic computations, based on a graph transformation recently proposed, which avoids making irrevocable non-deterministic choices that would jeopardize the completeness of computations. In contrast to other approaches with this property, it does not require an upfront cloning of a possibly large portion of the choice's context. We formally define the pull-tab transformation, characterize the class of programs for which the transformation is intended, extend the computations in these programs to include the transformation, and prove the corre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0190","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":"1108.0190","created_at":"2026-05-18T04:16:31.546306+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.0190v1","created_at":"2026-05-18T04:16:31.546306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0190","created_at":"2026-05-18T04:16:31.546306+00:00"},{"alias_kind":"pith_short_12","alias_value":"TE3S5TQDH74Y","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TE3S5TQDH74Y3UIP","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TE3S5TQD","created_at":"2026-05-18T12:26:42.757692+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/TE3S5TQDH74Y3UIPFYJF666FI4","json":"https://pith.science/pith/TE3S5TQDH74Y3UIPFYJF666FI4.json","graph_json":"https://pith.science/api/pith-number/TE3S5TQDH74Y3UIPFYJF666FI4/graph.json","events_json":"https://pith.science/api/pith-number/TE3S5TQDH74Y3UIPFYJF666FI4/events.json","paper":"https://pith.science/paper/TE3S5TQD"},"agent_actions":{"view_html":"https://pith.science/pith/TE3S5TQDH74Y3UIPFYJF666FI4","download_json":"https://pith.science/pith/TE3S5TQDH74Y3UIPFYJF666FI4.json","view_paper":"https://pith.science/paper/TE3S5TQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.0190&json=true","fetch_graph":"https://pith.science/api/pith-number/TE3S5TQDH74Y3UIPFYJF666FI4/graph.json","fetch_events":"https://pith.science/api/pith-number/TE3S5TQDH74Y3UIPFYJF666FI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TE3S5TQDH74Y3UIPFYJF666FI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TE3S5TQDH74Y3UIPFYJF666FI4/action/storage_attestation","attest_author":"https://pith.science/pith/TE3S5TQDH74Y3UIPFYJF666FI4/action/author_attestation","sign_citation":"https://pith.science/pith/TE3S5TQDH74Y3UIPFYJF666FI4/action/citation_signature","submit_replication":"https://pith.science/pith/TE3S5TQDH74Y3UIPFYJF666FI4/action/replication_record"}},"created_at":"2026-05-18T04:16:31.546306+00:00","updated_at":"2026-05-18T04:16:31.546306+00:00"}