{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B5B4D4K6DJBX5MNSHP3KO6RSSA","short_pith_number":"pith:B5B4D4K6","schema_version":"1.0","canonical_sha256":"0f43c1f15e1a437eb1b23bf6a77a3290234ff7917001a9e43fb4a6fcadf6e7c7","source":{"kind":"arxiv","id":"1709.08533","version":1},"attestation_state":"computed","paper":{"title":"Intensional Constructed Numbers: Towards Formalizing the Notion of Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Fritz M\\\"uller","submitted_at":"2017-09-25T15:01:01Z","abstract_excerpt":"This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working \"in a similar way\". But instead of defining equivalence transformations directly on programs, we look at the computation for each particular argument and give it a structure. This leads to the notion of constructed number: the result of the computation is a constructed number whose constructors (0, successor) carry a history condition (or trace) of their computation. There are equivalence relations on these conditions and on constructed numbers. Two"},"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":"1709.08533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-25T15:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"ac83851a16d04571521c328ab3face3936840bcd235072baa22dfb7ad1f65008","abstract_canon_sha256":"64d4f44df5199ec64d7ddbdded13607235e4efffd21421b61d453a35839430a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:25.368181Z","signature_b64":"h5lvhRvNNYtbO42/WzDk85qE9QrGaldRw9V0BlQDAiy8vQTGyLG43KKaD+bLsFF6q036D5THIm1GOuHzwKAABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f43c1f15e1a437eb1b23bf6a77a3290234ff7917001a9e43fb4a6fcadf6e7c7","last_reissued_at":"2026-05-18T00:34:25.367514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:25.367514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intensional Constructed Numbers: Towards Formalizing the Notion of Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Fritz M\\\"uller","submitted_at":"2017-09-25T15:01:01Z","abstract_excerpt":"This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working \"in a similar way\". But instead of defining equivalence transformations directly on programs, we look at the computation for each particular argument and give it a structure. This leads to the notion of constructed number: the result of the computation is a constructed number whose constructors (0, successor) carry a history condition (or trace) of their computation. There are equivalence relations on these conditions and on constructed numbers. Two"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08533","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":"1709.08533","created_at":"2026-05-18T00:34:25.367622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08533v1","created_at":"2026-05-18T00:34:25.367622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08533","created_at":"2026-05-18T00:34:25.367622+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5B4D4K6DJBX","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5B4D4K6DJBX5MNS","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5B4D4K6","created_at":"2026-05-18T12:31:08.081275+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/B5B4D4K6DJBX5MNSHP3KO6RSSA","json":"https://pith.science/pith/B5B4D4K6DJBX5MNSHP3KO6RSSA.json","graph_json":"https://pith.science/api/pith-number/B5B4D4K6DJBX5MNSHP3KO6RSSA/graph.json","events_json":"https://pith.science/api/pith-number/B5B4D4K6DJBX5MNSHP3KO6RSSA/events.json","paper":"https://pith.science/paper/B5B4D4K6"},"agent_actions":{"view_html":"https://pith.science/pith/B5B4D4K6DJBX5MNSHP3KO6RSSA","download_json":"https://pith.science/pith/B5B4D4K6DJBX5MNSHP3KO6RSSA.json","view_paper":"https://pith.science/paper/B5B4D4K6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08533&json=true","fetch_graph":"https://pith.science/api/pith-number/B5B4D4K6DJBX5MNSHP3KO6RSSA/graph.json","fetch_events":"https://pith.science/api/pith-number/B5B4D4K6DJBX5MNSHP3KO6RSSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5B4D4K6DJBX5MNSHP3KO6RSSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5B4D4K6DJBX5MNSHP3KO6RSSA/action/storage_attestation","attest_author":"https://pith.science/pith/B5B4D4K6DJBX5MNSHP3KO6RSSA/action/author_attestation","sign_citation":"https://pith.science/pith/B5B4D4K6DJBX5MNSHP3KO6RSSA/action/citation_signature","submit_replication":"https://pith.science/pith/B5B4D4K6DJBX5MNSHP3KO6RSSA/action/replication_record"}},"created_at":"2026-05-18T00:34:25.367622+00:00","updated_at":"2026-05-18T00:34:25.367622+00:00"}