{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K4XW3YP5SE7P5YIIU3LG6Q6ATZ","short_pith_number":"pith:K4XW3YP5","schema_version":"1.0","canonical_sha256":"572f6de1fd913efee108a6d66f43c09e6494792434e1cb5f89cc367173b758ec","source":{"kind":"arxiv","id":"1711.10530","version":2},"attestation_state":"computed","paper":{"title":"Parametrised second-order complexity theory with applications to the study of interval computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Eike Neumann, Florian Steinberg","submitted_at":"2017-11-28T19:48:59Z","abstract_excerpt":"We extend the framework for complexity of operators in analysis devised by Kawamura and Cook (2012) to allow for the treatment of a wider class of representations. The main novelty is to endow represented spaces of interest with an additional function on names, called a parameter, which measures the complexity of a given name. This parameter generalises the size function which is usually used in second-order complexity theory and therefore also central to the framework of Kawamura and Cook. The complexity of an algorithm is measured in terms of its running time as a second-order function in th"},"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":"1711.10530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-28T19:48:59Z","cross_cats_sorted":[],"title_canon_sha256":"27bcb85eba03c50b25174e2430d46b7c4e18fd40d70618b2fb94d5fc2ed1b125","abstract_canon_sha256":"2dfe3fdd8d5de60139e905c36af4de314f3d39d5128306e9f9e68b09a7f73172"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:33.436911Z","signature_b64":"OYfQ5l/BHHm10lz6ynATv7p5f/Qvpa3Ks3+cAONHXLTLn/ceHmp596g7BpdRlOjgPklCQd+PKZeU13uC5LZtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"572f6de1fd913efee108a6d66f43c09e6494792434e1cb5f89cc367173b758ec","last_reissued_at":"2026-05-17T23:43:33.436508Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:33.436508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parametrised second-order complexity theory with applications to the study of interval computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Eike Neumann, Florian Steinberg","submitted_at":"2017-11-28T19:48:59Z","abstract_excerpt":"We extend the framework for complexity of operators in analysis devised by Kawamura and Cook (2012) to allow for the treatment of a wider class of representations. The main novelty is to endow represented spaces of interest with an additional function on names, called a parameter, which measures the complexity of a given name. This parameter generalises the size function which is usually used in second-order complexity theory and therefore also central to the framework of Kawamura and Cook. The complexity of an algorithm is measured in terms of its running time as a second-order function in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10530","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":""},"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":"1711.10530","created_at":"2026-05-17T23:43:33.436572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10530v2","created_at":"2026-05-17T23:43:33.436572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10530","created_at":"2026-05-17T23:43:33.436572+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4XW3YP5SE7P","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4XW3YP5SE7P5YII","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4XW3YP5","created_at":"2026-05-18T12:31:24.725408+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/K4XW3YP5SE7P5YIIU3LG6Q6ATZ","json":"https://pith.science/pith/K4XW3YP5SE7P5YIIU3LG6Q6ATZ.json","graph_json":"https://pith.science/api/pith-number/K4XW3YP5SE7P5YIIU3LG6Q6ATZ/graph.json","events_json":"https://pith.science/api/pith-number/K4XW3YP5SE7P5YIIU3LG6Q6ATZ/events.json","paper":"https://pith.science/paper/K4XW3YP5"},"agent_actions":{"view_html":"https://pith.science/pith/K4XW3YP5SE7P5YIIU3LG6Q6ATZ","download_json":"https://pith.science/pith/K4XW3YP5SE7P5YIIU3LG6Q6ATZ.json","view_paper":"https://pith.science/paper/K4XW3YP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10530&json=true","fetch_graph":"https://pith.science/api/pith-number/K4XW3YP5SE7P5YIIU3LG6Q6ATZ/graph.json","fetch_events":"https://pith.science/api/pith-number/K4XW3YP5SE7P5YIIU3LG6Q6ATZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4XW3YP5SE7P5YIIU3LG6Q6ATZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4XW3YP5SE7P5YIIU3LG6Q6ATZ/action/storage_attestation","attest_author":"https://pith.science/pith/K4XW3YP5SE7P5YIIU3LG6Q6ATZ/action/author_attestation","sign_citation":"https://pith.science/pith/K4XW3YP5SE7P5YIIU3LG6Q6ATZ/action/citation_signature","submit_replication":"https://pith.science/pith/K4XW3YP5SE7P5YIIU3LG6Q6ATZ/action/replication_record"}},"created_at":"2026-05-17T23:43:33.436572+00:00","updated_at":"2026-05-17T23:43:33.436572+00:00"}