{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:R5GQVXXUSY6UUMJSYKSUJ5K7SQ","short_pith_number":"pith:R5GQVXXU","schema_version":"1.0","canonical_sha256":"8f4d0adef4963d4a3132c2a544f55f941357180e5c5e18851d9c54c7cefeaca8","source":{"kind":"arxiv","id":"1712.01407","version":2},"attestation_state":"computed","paper":{"title":"Iteration entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joachim von zur Gathen","submitted_at":"2017-12-04T23:07:16Z","abstract_excerpt":"We apply a common measure of randomness, the entropy, in the context of iterated functions on a finite set with n elements. For a permutation, it turns out that this entropy is asymptotically (for a growing number of iterations) close to \\log_2(n) minus the entropy of the vector of its cycle lengths. For general functions, a similar approximation holds."},"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":"1712.01407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-12-04T23:07:16Z","cross_cats_sorted":[],"title_canon_sha256":"eff99a328b06ba976e0be6448b4da63f217569fdc0c8ba025d0447d094106e30","abstract_canon_sha256":"74db8915bcd35b4feefa633e8af4e28dcb6b278c63fa15fdf60dd7ec55710629"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:41.422539Z","signature_b64":"iMC8pf7lwFqP6urg08R0TMh5IZVBRE3Kgdx7UtwIZ8TbrbCUdf1/kXBh8M3pm4s89fr9tM5y2K0Az2EMt3BNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f4d0adef4963d4a3132c2a544f55f941357180e5c5e18851d9c54c7cefeaca8","last_reissued_at":"2026-05-18T00:27:41.421779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:41.421779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iteration entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joachim von zur Gathen","submitted_at":"2017-12-04T23:07:16Z","abstract_excerpt":"We apply a common measure of randomness, the entropy, in the context of iterated functions on a finite set with n elements. For a permutation, it turns out that this entropy is asymptotically (for a growing number of iterations) close to \\log_2(n) minus the entropy of the vector of its cycle lengths. For general functions, a similar approximation holds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01407","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":"1712.01407","created_at":"2026-05-18T00:27:41.421913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01407v2","created_at":"2026-05-18T00:27:41.421913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01407","created_at":"2026-05-18T00:27:41.421913+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5GQVXXUSY6U","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5GQVXXUSY6UUMJS","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5GQVXXU","created_at":"2026-05-18T12:31:39.905425+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/R5GQVXXUSY6UUMJSYKSUJ5K7SQ","json":"https://pith.science/pith/R5GQVXXUSY6UUMJSYKSUJ5K7SQ.json","graph_json":"https://pith.science/api/pith-number/R5GQVXXUSY6UUMJSYKSUJ5K7SQ/graph.json","events_json":"https://pith.science/api/pith-number/R5GQVXXUSY6UUMJSYKSUJ5K7SQ/events.json","paper":"https://pith.science/paper/R5GQVXXU"},"agent_actions":{"view_html":"https://pith.science/pith/R5GQVXXUSY6UUMJSYKSUJ5K7SQ","download_json":"https://pith.science/pith/R5GQVXXUSY6UUMJSYKSUJ5K7SQ.json","view_paper":"https://pith.science/paper/R5GQVXXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01407&json=true","fetch_graph":"https://pith.science/api/pith-number/R5GQVXXUSY6UUMJSYKSUJ5K7SQ/graph.json","fetch_events":"https://pith.science/api/pith-number/R5GQVXXUSY6UUMJSYKSUJ5K7SQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5GQVXXUSY6UUMJSYKSUJ5K7SQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5GQVXXUSY6UUMJSYKSUJ5K7SQ/action/storage_attestation","attest_author":"https://pith.science/pith/R5GQVXXUSY6UUMJSYKSUJ5K7SQ/action/author_attestation","sign_citation":"https://pith.science/pith/R5GQVXXUSY6UUMJSYKSUJ5K7SQ/action/citation_signature","submit_replication":"https://pith.science/pith/R5GQVXXUSY6UUMJSYKSUJ5K7SQ/action/replication_record"}},"created_at":"2026-05-18T00:27:41.421913+00:00","updated_at":"2026-05-18T00:27:41.421913+00:00"}