{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:J2NP63EGXEWV2THCXFKNZGSYWU","short_pith_number":"pith:J2NP63EG","schema_version":"1.0","canonical_sha256":"4e9aff6c86b92d5d4ce2b954dc9a58b5249c669462d679e1ffaf3048cc801970","source":{"kind":"arxiv","id":"2504.11371","version":2},"attestation_state":"computed","paper":{"title":"Taxonomy of Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","nlin.AO"],"primary_cat":"cond-mat.stat-mech","authors_text":"Alexandra Jurgens, James P. Crutchfield","submitted_at":"2025-04-15T16:36:20Z","abstract_excerpt":"A prediction makes a claim about a system's future given knowledge of its past. A retrodiction makes a claim about its past given knowledge of its future. The bidirectional machine is an ambidextrous hidden Markov chain that does both optimally by making explicit in its state structure all statistical correlation in a stochastic process. We introduce an informational taxonomy to profile these correlations via a suite of multivariate information measures. While prior results laid out the different kinds of information contained in isolated measurement of a bit, the associated informations were "},"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":"2504.11371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2025-04-15T16:36:20Z","cross_cats_sorted":["cs.IT","math.IT","nlin.AO"],"title_canon_sha256":"f05a519222b4afc609f37b1a3e12f788e96c9ce2c4fa41a0865ac81508611e55","abstract_canon_sha256":"2000023af35d8f2a9bb6483405c6c7a4e1c0b6d01303ac3c5f14ab4d8027bfc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:44.279621Z","signature_b64":"yy9UVs9hUDKguwQuXMkDvvB2bk2T5UiyWkltZgoosTSjwIkg7JcPuPFNkbh5R8UfnCDQBExQB7mS+utZnD8JCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e9aff6c86b92d5d4ce2b954dc9a58b5249c669462d679e1ffaf3048cc801970","last_reissued_at":"2026-07-05T11:25:44.279025Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:44.279025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Taxonomy of Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","nlin.AO"],"primary_cat":"cond-mat.stat-mech","authors_text":"Alexandra Jurgens, James P. Crutchfield","submitted_at":"2025-04-15T16:36:20Z","abstract_excerpt":"A prediction makes a claim about a system's future given knowledge of its past. A retrodiction makes a claim about its past given knowledge of its future. The bidirectional machine is an ambidextrous hidden Markov chain that does both optimally by making explicit in its state structure all statistical correlation in a stochastic process. We introduce an informational taxonomy to profile these correlations via a suite of multivariate information measures. While prior results laid out the different kinds of information contained in isolated measurement of a bit, the associated informations were "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.11371","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.11371/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.11371","created_at":"2026-07-05T11:25:44.279084+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.11371v2","created_at":"2026-07-05T11:25:44.279084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11371","created_at":"2026-07-05T11:25:44.279084+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2NP63EGXEWV","created_at":"2026-07-05T11:25:44.279084+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2NP63EGXEWV2THC","created_at":"2026-07-05T11:25:44.279084+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2NP63EG","created_at":"2026-07-05T11:25:44.279084+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19275","citing_title":"Agentic Information Theory: Ergodicity and Intrinsic Semantics of Information Processes","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J2NP63EGXEWV2THCXFKNZGSYWU","json":"https://pith.science/pith/J2NP63EGXEWV2THCXFKNZGSYWU.json","graph_json":"https://pith.science/api/pith-number/J2NP63EGXEWV2THCXFKNZGSYWU/graph.json","events_json":"https://pith.science/api/pith-number/J2NP63EGXEWV2THCXFKNZGSYWU/events.json","paper":"https://pith.science/paper/J2NP63EG"},"agent_actions":{"view_html":"https://pith.science/pith/J2NP63EGXEWV2THCXFKNZGSYWU","download_json":"https://pith.science/pith/J2NP63EGXEWV2THCXFKNZGSYWU.json","view_paper":"https://pith.science/paper/J2NP63EG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.11371&json=true","fetch_graph":"https://pith.science/api/pith-number/J2NP63EGXEWV2THCXFKNZGSYWU/graph.json","fetch_events":"https://pith.science/api/pith-number/J2NP63EGXEWV2THCXFKNZGSYWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2NP63EGXEWV2THCXFKNZGSYWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2NP63EGXEWV2THCXFKNZGSYWU/action/storage_attestation","attest_author":"https://pith.science/pith/J2NP63EGXEWV2THCXFKNZGSYWU/action/author_attestation","sign_citation":"https://pith.science/pith/J2NP63EGXEWV2THCXFKNZGSYWU/action/citation_signature","submit_replication":"https://pith.science/pith/J2NP63EGXEWV2THCXFKNZGSYWU/action/replication_record"}},"created_at":"2026-07-05T11:25:44.279084+00:00","updated_at":"2026-07-05T11:25:44.279084+00:00"}