{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:WIVUPB23THGFNNOKGILPUIV2YS","short_pith_number":"pith:WIVUPB23","schema_version":"1.0","canonical_sha256":"b22b47875b99cc56b5ca3216fa22bac4b17b76e4421e763f7fa23f0ddadd5f02","source":{"kind":"arxiv","id":"0710.0824","version":2},"attestation_state":"computed","paper":{"title":"Two algorithms in search of a type system","license":"","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"James S. Royer, Norman Danner","submitted_at":"2007-10-03T16:04:59Z","abstract_excerpt":"The authors' ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR-definable (ATR types are confined to levels 0, 1, and 2). A limitation of the original version of ATR is that the only directly expressible recursions are tail-recursions. Here we extend ATR so that a broad range of affine recursions are directly expressible. In particular, the revised ATR can fairly naturally express the classic insertion- and selection-sort algorit"},"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":"0710.0824","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-10-03T16:04:59Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"d3a074b1f92a9189c0e8313a8e99841a89075e2b6ff07bbfe820a330de30ac25","abstract_canon_sha256":"f6249170800f62b67b477de30748adc14a625fe11ec6a9be6f593d1aa8ba0165"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:10:56.306401Z","signature_b64":"rt+6CQUpelfG+TdrwyuQdNdVKcf3nsvbvaiz835lnF5zUgUuNrXKpq7PCewgpRK6bGFvsvHGIJqCPEBrAfm1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b22b47875b99cc56b5ca3216fa22bac4b17b76e4421e763f7fa23f0ddadd5f02","last_reissued_at":"2026-07-04T15:10:56.305904Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:10:56.305904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two algorithms in search of a type system","license":"","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"James S. Royer, Norman Danner","submitted_at":"2007-10-03T16:04:59Z","abstract_excerpt":"The authors' ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR-definable (ATR types are confined to levels 0, 1, and 2). A limitation of the original version of ATR is that the only directly expressible recursions are tail-recursions. Here we extend ATR so that a broad range of affine recursions are directly expressible. In particular, the revised ATR can fairly naturally express the classic insertion- and selection-sort algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.0824","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0710.0824/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0710.0824","created_at":"2026-07-04T15:10:56.305960+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.0824v2","created_at":"2026-07-04T15:10:56.305960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.0824","created_at":"2026-07-04T15:10:56.305960+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIVUPB23THGF","created_at":"2026-07-04T15:10:56.305960+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIVUPB23THGFNNOK","created_at":"2026-07-04T15:10:56.305960+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIVUPB23","created_at":"2026-07-04T15:10:56.305960+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/WIVUPB23THGFNNOKGILPUIV2YS","json":"https://pith.science/pith/WIVUPB23THGFNNOKGILPUIV2YS.json","graph_json":"https://pith.science/api/pith-number/WIVUPB23THGFNNOKGILPUIV2YS/graph.json","events_json":"https://pith.science/api/pith-number/WIVUPB23THGFNNOKGILPUIV2YS/events.json","paper":"https://pith.science/paper/WIVUPB23"},"agent_actions":{"view_html":"https://pith.science/pith/WIVUPB23THGFNNOKGILPUIV2YS","download_json":"https://pith.science/pith/WIVUPB23THGFNNOKGILPUIV2YS.json","view_paper":"https://pith.science/paper/WIVUPB23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.0824&json=true","fetch_graph":"https://pith.science/api/pith-number/WIVUPB23THGFNNOKGILPUIV2YS/graph.json","fetch_events":"https://pith.science/api/pith-number/WIVUPB23THGFNNOKGILPUIV2YS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIVUPB23THGFNNOKGILPUIV2YS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIVUPB23THGFNNOKGILPUIV2YS/action/storage_attestation","attest_author":"https://pith.science/pith/WIVUPB23THGFNNOKGILPUIV2YS/action/author_attestation","sign_citation":"https://pith.science/pith/WIVUPB23THGFNNOKGILPUIV2YS/action/citation_signature","submit_replication":"https://pith.science/pith/WIVUPB23THGFNNOKGILPUIV2YS/action/replication_record"}},"created_at":"2026-07-04T15:10:56.305960+00:00","updated_at":"2026-07-04T15:10:56.305960+00:00"}