{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:QMIOPOIYFQHLMCZXSD24MU7M7K","short_pith_number":"pith:QMIOPOIY","canonical_record":{"source":{"id":"cs/0701076","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-01-11T16:22:11Z","cross_cats_sorted":[],"title_canon_sha256":"759165763f66c062f798ff25842a771182e0b287e9c45cecb47d8194c03e5d61","abstract_canon_sha256":"479c6a80c2cef0af24106e5682ce70557fd46df51e7375e1477cd9cfe4c3c38d"},"schema_version":"1.0"},"canonical_sha256":"8310e7b9182c0eb60b3790f5c653ecfa8367a3db38ef9a9e58db293117693057","source":{"kind":"arxiv","id":"cs/0701076","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701076","created_at":"2026-07-04T15:00:15Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701076v2","created_at":"2026-07-04T15:00:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701076","created_at":"2026-07-04T15:00:15Z"},{"alias_kind":"pith_short_12","alias_value":"QMIOPOIYFQHL","created_at":"2026-07-04T15:00:15Z"},{"alias_kind":"pith_short_16","alias_value":"QMIOPOIYFQHLMCZX","created_at":"2026-07-04T15:00:15Z"},{"alias_kind":"pith_short_8","alias_value":"QMIOPOIY","created_at":"2026-07-04T15:00:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:QMIOPOIYFQHLMCZXSD24MU7M7K","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0701076","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-01-11T16:22:11Z","cross_cats_sorted":[],"title_canon_sha256":"759165763f66c062f798ff25842a771182e0b287e9c45cecb47d8194c03e5d61","abstract_canon_sha256":"479c6a80c2cef0af24106e5682ce70557fd46df51e7375e1477cd9cfe4c3c38d"},"schema_version":"1.0"},"canonical_sha256":"8310e7b9182c0eb60b3790f5c653ecfa8367a3db38ef9a9e58db293117693057","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:00:15.665861Z","signature_b64":"1fRn5cw9YbSOZ+7XDYnrJ8FUqeKlI1nIvZtRsWkFYlMz6L9vu71fHTdki3ay6dxBD5gy8VEcrkwDicmN/555Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8310e7b9182c0eb60b3790f5c653ecfa8367a3db38ef9a9e58db293117693057","last_reissued_at":"2026-07-04T15:00:15.665460Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:00:15.665460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0701076","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T15:00:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IqKDqZsZWEgaqraFBNmloj+JXni9Fp1YFDftiPXI8qIlRcsdMqJGayZyZllfi7tHioIcKDPlO553wkJKRBTWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:34:11.619437Z"},"content_sha256":"6fe300bc0484334af71fb36b60b3f1b91e3689ecd71f5441cfa811f7e43097c5","schema_version":"1.0","event_id":"sha256:6fe300bc0484334af71fb36b60b3f1b91e3689ecd71f5441cfa811f7e43097c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:QMIOPOIYFQHLMCZXSD24MU7M7K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time-complexity semantics for feasible affine recursions (extended abstract)","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"James S. Royer, Norman Danner","submitted_at":"2007-01-11T16:22:11Z","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":"cs/0701076","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/cs/0701076/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T15:00:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GuFTPOSWq+Msq38cfn7/h9CfFJD00EkpCU9wojWZN8geqI0SZd+MmmKbxq/wxs/xEb2X7FVO6cG458Bu48TDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:34:11.620116Z"},"content_sha256":"a8c11b687cb5d1ef2e394fb9b14a3de6ccae7f98093eaa0ec7445e7b277b6317","schema_version":"1.0","event_id":"sha256:a8c11b687cb5d1ef2e394fb9b14a3de6ccae7f98093eaa0ec7445e7b277b6317"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMIOPOIYFQHLMCZXSD24MU7M7K/bundle.json","state_url":"https://pith.science/pith/QMIOPOIYFQHLMCZXSD24MU7M7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMIOPOIYFQHLMCZXSD24MU7M7K/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T10:34:11Z","links":{"resolver":"https://pith.science/pith/QMIOPOIYFQHLMCZXSD24MU7M7K","bundle":"https://pith.science/pith/QMIOPOIYFQHLMCZXSD24MU7M7K/bundle.json","state":"https://pith.science/pith/QMIOPOIYFQHLMCZXSD24MU7M7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMIOPOIYFQHLMCZXSD24MU7M7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:QMIOPOIYFQHLMCZXSD24MU7M7K","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"479c6a80c2cef0af24106e5682ce70557fd46df51e7375e1477cd9cfe4c3c38d","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2007-01-11T16:22:11Z","title_canon_sha256":"759165763f66c062f798ff25842a771182e0b287e9c45cecb47d8194c03e5d61"},"schema_version":"1.0","source":{"id":"cs/0701076","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701076","created_at":"2026-07-04T15:00:15Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701076v2","created_at":"2026-07-04T15:00:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701076","created_at":"2026-07-04T15:00:15Z"},{"alias_kind":"pith_short_12","alias_value":"QMIOPOIYFQHL","created_at":"2026-07-04T15:00:15Z"},{"alias_kind":"pith_short_16","alias_value":"QMIOPOIYFQHLMCZX","created_at":"2026-07-04T15:00:15Z"},{"alias_kind":"pith_short_8","alias_value":"QMIOPOIY","created_at":"2026-07-04T15:00:15Z"}],"graph_snapshots":[{"event_id":"sha256:a8c11b687cb5d1ef2e394fb9b14a3de6ccae7f98093eaa0ec7445e7b277b6317","target":"graph","created_at":"2026-07-04T15:00:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0701076/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"James S. Royer, Norman Danner","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2007-01-11T16:22:11Z","title":"Time-complexity semantics for feasible affine recursions (extended abstract)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701076","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6fe300bc0484334af71fb36b60b3f1b91e3689ecd71f5441cfa811f7e43097c5","target":"record","created_at":"2026-07-04T15:00:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"479c6a80c2cef0af24106e5682ce70557fd46df51e7375e1477cd9cfe4c3c38d","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2007-01-11T16:22:11Z","title_canon_sha256":"759165763f66c062f798ff25842a771182e0b287e9c45cecb47d8194c03e5d61"},"schema_version":"1.0","source":{"id":"cs/0701076","kind":"arxiv","version":2}},"canonical_sha256":"8310e7b9182c0eb60b3790f5c653ecfa8367a3db38ef9a9e58db293117693057","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8310e7b9182c0eb60b3790f5c653ecfa8367a3db38ef9a9e58db293117693057","first_computed_at":"2026-07-04T15:00:15.665460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:00:15.665460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1fRn5cw9YbSOZ+7XDYnrJ8FUqeKlI1nIvZtRsWkFYlMz6L9vu71fHTdki3ay6dxBD5gy8VEcrkwDicmN/555Aw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:00:15.665861Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0701076","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fe300bc0484334af71fb36b60b3f1b91e3689ecd71f5441cfa811f7e43097c5","sha256:a8c11b687cb5d1ef2e394fb9b14a3de6ccae7f98093eaa0ec7445e7b277b6317"],"state_sha256":"f0f2c4908223e5300b1fd66b01186ce257dfc3048ef5a80be5a396eb2d3e24e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u9r5eHgAV4wkzIaiJgm15OROOGygPuB+ZJtMmPcGRUEm/YdLiVQtjYB4gnSQ14GyX9PCg8cXkN08TwzvVSmCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T10:34:11.623907Z","bundle_sha256":"59626889dc02fb2e522f9b5e41bad42b4cf62fa904125284f1dbb5ba70e0f9f7"}}