{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B7RVRR7JWHEG4AHE6GIK7UP5WV","short_pith_number":"pith:B7RVRR7J","canonical_record":{"source":{"id":"1504.00386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-04-01T20:55:10Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"5cabf5be4a90e82a5747b1088fe232fa75c3d3c900eb745e3809c3922f7beca3","abstract_canon_sha256":"ab1879482e0bf2ed94fbadbf11626e943fcd452ef2f521da86c83b62d4eb9d81"},"schema_version":"1.0"},"canonical_sha256":"0fe358c7e9b1c86e00e4f190afd1fdb56c0469571ceea77dc7f54b9d88cea1af","source":{"kind":"arxiv","id":"1504.00386","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00386","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00386v1","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00386","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"B7RVRR7JWHEG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B7RVRR7JWHEG4AHE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B7RVRR7J","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B7RVRR7JWHEG4AHE6GIK7UP5WV","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-04-01T20:55:10Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"5cabf5be4a90e82a5747b1088fe232fa75c3d3c900eb745e3809c3922f7beca3","abstract_canon_sha256":"ab1879482e0bf2ed94fbadbf11626e943fcd452ef2f521da86c83b62d4eb9d81"},"schema_version":"1.0"},"canonical_sha256":"0fe358c7e9b1c86e00e4f190afd1fdb56c0469571ceea77dc7f54b9d88cea1af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:43.406288Z","signature_b64":"l8jCutsgurmxjakiNNSLXwKUDwHr9ds98hAHkMYt7JBvd/Am5P9JJ+VJccO4Fr7wEhEAWoEx9Mg3Jlhaevq3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fe358c7e9b1c86e00e4f190afd1fdb56c0469571ceea77dc7f54b9d88cea1af","last_reissued_at":"2026-05-18T02:19:43.405817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:43.405817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00386","source_version":1,"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-18T02:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLo5Y+qJLDoeDIK0YASU9NgMwwjstX7lgG2MczLo7dixAzcdey6mUEaJF2fu4BRh6aFqPAsj1Phzef7hH9AACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:46:09.006602Z"},"content_sha256":"405af2b1d074d0dbf635487ecbfe1ec37e6096c802509d33942e144db668103e","schema_version":"1.0","event_id":"sha256:405af2b1d074d0dbf635487ecbfe1ec37e6096c802509d33942e144db668103e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B7RVRR7JWHEG4AHE6GIK7UP5WV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Signatures of Infinity: Nonergodicity and Resource Scaling in Prediction, Complexity, and Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"cond-mat.stat-mech","authors_text":"James P. Crutchfield, Sarah Marzen","submitted_at":"2015-04-01T20:55:10Z","abstract_excerpt":"We introduce a simple analysis of the structural complexity of infinite-memory processes built from random samples of stationary, ergodic finite-memory component processes. Such processes are familiar from the well known multi-arm Bandit problem. We contrast our analysis with computation-theoretic and statistical inference approaches to understanding their complexity. The result is an alternative view of the relationship between predictability, complexity, and learning that highlights the distinct ways in which informational and correlational divergences arise in complex ergodic and nonergodic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00386","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"},"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-18T02:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"unx0ivE7PCqZTcoEEQJM/KBkLoYyLbWAoWRc01EtlV4sRKgLDAWxVo35os/C03Q6VULJIlrXPCatRv0B/oGKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:46:09.007346Z"},"content_sha256":"0938fc5086772c76b14aca5bc49854a8bbec28136abae3d9d560a9608729678e","schema_version":"1.0","event_id":"sha256:0938fc5086772c76b14aca5bc49854a8bbec28136abae3d9d560a9608729678e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7RVRR7JWHEG4AHE6GIK7UP5WV/bundle.json","state_url":"https://pith.science/pith/B7RVRR7JWHEG4AHE6GIK7UP5WV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7RVRR7JWHEG4AHE6GIK7UP5WV/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-08T15:46:09Z","links":{"resolver":"https://pith.science/pith/B7RVRR7JWHEG4AHE6GIK7UP5WV","bundle":"https://pith.science/pith/B7RVRR7JWHEG4AHE6GIK7UP5WV/bundle.json","state":"https://pith.science/pith/B7RVRR7JWHEG4AHE6GIK7UP5WV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7RVRR7JWHEG4AHE6GIK7UP5WV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B7RVRR7JWHEG4AHE6GIK7UP5WV","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":"ab1879482e0bf2ed94fbadbf11626e943fcd452ef2f521da86c83b62d4eb9d81","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-04-01T20:55:10Z","title_canon_sha256":"5cabf5be4a90e82a5747b1088fe232fa75c3d3c900eb745e3809c3922f7beca3"},"schema_version":"1.0","source":{"id":"1504.00386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00386","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00386v1","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00386","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"B7RVRR7JWHEG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B7RVRR7JWHEG4AHE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B7RVRR7J","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:0938fc5086772c76b14aca5bc49854a8bbec28136abae3d9d560a9608729678e","target":"graph","created_at":"2026-05-18T02:19:43Z","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":"We introduce a simple analysis of the structural complexity of infinite-memory processes built from random samples of stationary, ergodic finite-memory component processes. Such processes are familiar from the well known multi-arm Bandit problem. We contrast our analysis with computation-theoretic and statistical inference approaches to understanding their complexity. The result is an alternative view of the relationship between predictability, complexity, and learning that highlights the distinct ways in which informational and correlational divergences arise in complex ergodic and nonergodic","authors_text":"James P. Crutchfield, Sarah Marzen","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-04-01T20:55:10Z","title":"Signatures of Infinity: Nonergodicity and Resource Scaling in Prediction, Complexity, and Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00386","kind":"arxiv","version":1},"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:405af2b1d074d0dbf635487ecbfe1ec37e6096c802509d33942e144db668103e","target":"record","created_at":"2026-05-18T02:19:43Z","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":"ab1879482e0bf2ed94fbadbf11626e943fcd452ef2f521da86c83b62d4eb9d81","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-04-01T20:55:10Z","title_canon_sha256":"5cabf5be4a90e82a5747b1088fe232fa75c3d3c900eb745e3809c3922f7beca3"},"schema_version":"1.0","source":{"id":"1504.00386","kind":"arxiv","version":1}},"canonical_sha256":"0fe358c7e9b1c86e00e4f190afd1fdb56c0469571ceea77dc7f54b9d88cea1af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fe358c7e9b1c86e00e4f190afd1fdb56c0469571ceea77dc7f54b9d88cea1af","first_computed_at":"2026-05-18T02:19:43.405817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:43.405817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l8jCutsgurmxjakiNNSLXwKUDwHr9ds98hAHkMYt7JBvd/Am5P9JJ+VJccO4Fr7wEhEAWoEx9Mg3Jlhaevq3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:43.406288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:405af2b1d074d0dbf635487ecbfe1ec37e6096c802509d33942e144db668103e","sha256:0938fc5086772c76b14aca5bc49854a8bbec28136abae3d9d560a9608729678e"],"state_sha256":"78f1d31e35d27d512c52e9aea5d15058c9e300cd155303a540de57ba815d7d01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kV7vD+ZBrXJ9vP5qyH13k/2eJAbLST6HcJKfW8TcyT28UtRkyQwck3O9nMGN2pg0SKnAYipRn6/hxrB3X5YsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:46:09.011682Z","bundle_sha256":"83a620c08fc7b3f5ff9239d4b5d06998aafd0f86082bbc22d023558cb77b30fe"}}