{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HYVOX4NY6QAN6WXI6AYIHHELXR","short_pith_number":"pith:HYVOX4NY","canonical_record":{"source":{"id":"1704.01405","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-05T13:23:09Z","cross_cats_sorted":[],"title_canon_sha256":"fbd678d2091f078001a5ba18c6a3a91dec11e1f7280aeb49f4b3d59c87cf15be","abstract_canon_sha256":"174bd792da00706fa63090fa238333cb0e62a320f13419243d9db4a2e3cdc06c"},"schema_version":"1.0"},"canonical_sha256":"3e2aebf1b8f400df5ae8f030839c8bbc6acd8dfe883590ad0e50a62e3c4c7ef6","source":{"kind":"arxiv","id":"1704.01405","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01405","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01405v2","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01405","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"pith_short_12","alias_value":"HYVOX4NY6QAN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HYVOX4NY6QAN6WXI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HYVOX4NY","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HYVOX4NY6QAN6WXI6AYIHHELXR","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01405","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-05T13:23:09Z","cross_cats_sorted":[],"title_canon_sha256":"fbd678d2091f078001a5ba18c6a3a91dec11e1f7280aeb49f4b3d59c87cf15be","abstract_canon_sha256":"174bd792da00706fa63090fa238333cb0e62a320f13419243d9db4a2e3cdc06c"},"schema_version":"1.0"},"canonical_sha256":"3e2aebf1b8f400df5ae8f030839c8bbc6acd8dfe883590ad0e50a62e3c4c7ef6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:15.508970Z","signature_b64":"7oWRiw3jZ/lE83lk/8O9ZPa65gRcqGyD0JD097KtsljehW78OKOv0RtXRl6g6p7gRAboXAMuSh96px3UrvoDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e2aebf1b8f400df5ae8f030839c8bbc6acd8dfe883590ad0e50a62e3c4c7ef6","last_reissued_at":"2026-05-18T00:43:15.508394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:15.508394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01405","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-05-18T00:43:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjlDnRI9HQ0wn8v3IG05JS4UnyJ9h21vPnz5XupA9O140VdFuwIdweJNtXUtc2oWqyE2b44VPNcMRKBlIys5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:05:51.668823Z"},"content_sha256":"3716177bdbb8411008c3736aadd700f01fc3d7ccbb18482d57f4098047d9f748","schema_version":"1.0","event_id":"sha256:3716177bdbb8411008c3736aadd700f01fc3d7ccbb18482d57f4098047d9f748"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HYVOX4NY6QAN6WXI6AYIHHELXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial running times for polynomial-time oracle machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Akitoshi Kawamura, Florian Steinberg","submitted_at":"2017-04-05T13:23:09Z","abstract_excerpt":"This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of oracle Turing machines and avoiding second-order polynomials, which are notoriously difficult to handle. Furthermore, all machines that witness this stronger kind of feasibility can be clocked and the different traditions of treating partial operators from computable analysis and second-order complexity theory are equated in a precise sense. The new n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01405","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"},"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-05-18T00:43:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GsBSf+XFUhax2gdviXdQzBOfOftrOjvdAKz5HSoxQiX8JAGZFYRmomE/whFQ7OsqXtUjmv0zM1YdO7Z7lnDwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:05:51.669160Z"},"content_sha256":"0d47bc4f8e0ba3d03adf1740266fc29451d2ab90591c12264ce15f89fc05d57e","schema_version":"1.0","event_id":"sha256:0d47bc4f8e0ba3d03adf1740266fc29451d2ab90591c12264ce15f89fc05d57e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYVOX4NY6QAN6WXI6AYIHHELXR/bundle.json","state_url":"https://pith.science/pith/HYVOX4NY6QAN6WXI6AYIHHELXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYVOX4NY6QAN6WXI6AYIHHELXR/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-06-28T04:05:51Z","links":{"resolver":"https://pith.science/pith/HYVOX4NY6QAN6WXI6AYIHHELXR","bundle":"https://pith.science/pith/HYVOX4NY6QAN6WXI6AYIHHELXR/bundle.json","state":"https://pith.science/pith/HYVOX4NY6QAN6WXI6AYIHHELXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYVOX4NY6QAN6WXI6AYIHHELXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HYVOX4NY6QAN6WXI6AYIHHELXR","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":"174bd792da00706fa63090fa238333cb0e62a320f13419243d9db4a2e3cdc06c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-05T13:23:09Z","title_canon_sha256":"fbd678d2091f078001a5ba18c6a3a91dec11e1f7280aeb49f4b3d59c87cf15be"},"schema_version":"1.0","source":{"id":"1704.01405","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01405","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01405v2","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01405","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"pith_short_12","alias_value":"HYVOX4NY6QAN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HYVOX4NY6QAN6WXI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HYVOX4NY","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:0d47bc4f8e0ba3d03adf1740266fc29451d2ab90591c12264ce15f89fc05d57e","target":"graph","created_at":"2026-05-18T00:43: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"},"paper":{"abstract_excerpt":"This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of oracle Turing machines and avoiding second-order polynomials, which are notoriously difficult to handle. Furthermore, all machines that witness this stronger kind of feasibility can be clocked and the different traditions of treating partial operators from computable analysis and second-order complexity theory are equated in a precise sense. The new n","authors_text":"Akitoshi Kawamura, Florian Steinberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-05T13:23:09Z","title":"Polynomial running times for polynomial-time oracle machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01405","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:3716177bdbb8411008c3736aadd700f01fc3d7ccbb18482d57f4098047d9f748","target":"record","created_at":"2026-05-18T00:43: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":"174bd792da00706fa63090fa238333cb0e62a320f13419243d9db4a2e3cdc06c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-05T13:23:09Z","title_canon_sha256":"fbd678d2091f078001a5ba18c6a3a91dec11e1f7280aeb49f4b3d59c87cf15be"},"schema_version":"1.0","source":{"id":"1704.01405","kind":"arxiv","version":2}},"canonical_sha256":"3e2aebf1b8f400df5ae8f030839c8bbc6acd8dfe883590ad0e50a62e3c4c7ef6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e2aebf1b8f400df5ae8f030839c8bbc6acd8dfe883590ad0e50a62e3c4c7ef6","first_computed_at":"2026-05-18T00:43:15.508394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:15.508394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7oWRiw3jZ/lE83lk/8O9ZPa65gRcqGyD0JD097KtsljehW78OKOv0RtXRl6g6p7gRAboXAMuSh96px3UrvoDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:15.508970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01405","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3716177bdbb8411008c3736aadd700f01fc3d7ccbb18482d57f4098047d9f748","sha256:0d47bc4f8e0ba3d03adf1740266fc29451d2ab90591c12264ce15f89fc05d57e"],"state_sha256":"aea11074056e7465c2d614e83ad74231e3b353066bf657a9a101f4a46df5029d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ldgViGbaPm6slc80zje4Kfoh+P9T8IY0CRT7yzVEfdaM9g+bokKGDyaKttzegIZ40TFf4LI1Y1+gCeiS27XDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T04:05:51.671849Z","bundle_sha256":"72130dcfa1b3537e49174c47ebcac70389cef6474d9971f8b5f59bc68348315e"}}