{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XMCT6J7J3OS4DTLMPNNX2BAVSX","short_pith_number":"pith:XMCT6J7J","canonical_record":{"source":{"id":"1608.01399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-08-04T00:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"655f6f39ed2471d464a88c5cdeef91517e80e9e70e7a412f419a238f04cff341","abstract_canon_sha256":"fd0ba59cda3aad7e1e98110e83fb3cda46e23cfbab7a7544a4bcb20e177353a0"},"schema_version":"1.0"},"canonical_sha256":"bb053f27e9dba5c1cd6c7b5b7d041595ccedb3b3a27836c1bdb5f547738b129b","source":{"kind":"arxiv","id":"1608.01399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01399","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01399v1","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01399","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"XMCT6J7J3OS4","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XMCT6J7J3OS4DTLM","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XMCT6J7J","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XMCT6J7J3OS4DTLMPNNX2BAVSX","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-08-04T00:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"655f6f39ed2471d464a88c5cdeef91517e80e9e70e7a412f419a238f04cff341","abstract_canon_sha256":"fd0ba59cda3aad7e1e98110e83fb3cda46e23cfbab7a7544a4bcb20e177353a0"},"schema_version":"1.0"},"canonical_sha256":"bb053f27e9dba5c1cd6c7b5b7d041595ccedb3b3a27836c1bdb5f547738b129b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:52.588728Z","signature_b64":"TUESIBF2jF9WuiVUuZ28+eZAnERCAJJfR22I7UBif5vAc+gN2COUEN/4B9EgfOw5XAYG/StZU9Zj5WYX8nQbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb053f27e9dba5c1cd6c7b5b7d041595ccedb3b3a27836c1bdb5f547738b129b","last_reissued_at":"2026-05-18T01:09:52.588152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:52.588152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01399","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-18T01:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJMLYeHhtlbaOYZW+ab9SycfRPvsduxmYmVRcv+yEucjTFONoK+HIJvIciiCHogPjSBy24iNVNChja/FEuvyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:21:25.379702Z"},"content_sha256":"5a4786d9bfa634905274957cb455974c1d3d494cdf2a4619a07206d7b04970d9","schema_version":"1.0","event_id":"sha256:5a4786d9bfa634905274957cb455974c1d3d494cdf2a4619a07206d7b04970d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XMCT6J7J3OS4DTLMPNNX2BAVSX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Few paths, fewer words: model selection with automatic structure functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bj{\\o}rn Kjos-Hanssen","submitted_at":"2016-08-04T00:10:40Z","abstract_excerpt":"We consider the problem of finding an optimal statistical model for a given binary string. Following Kolmogorov, we use structure functions. In order to get concrete results, we replace Turing machines by finite automata and Kolmogorov complexity by Shallit and Wang's automatic complexity.\n  The $p$-value of a model for given data $x$ is the probability that there exists a model with as few states, accepting as few words, fitting uniformly randomly selected data $y$.\n  Deterministic and nondeterministic automata can give different optimal models. For $x=011\\, 110\\, 110\\, 11$, the best determin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01399","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-18T01:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5fCzQN0hP8xo861NQUXcBvYWKQqoEI4Aooe5vQV6NXSwMHZVTKj9dxOQzeJfQX+x1rphMb9a0C/fX37vmP2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:21:25.380418Z"},"content_sha256":"f05c90e223cf653266960361b5dc8b912eb256d1d6a9eab36286dea34d9f71a1","schema_version":"1.0","event_id":"sha256:f05c90e223cf653266960361b5dc8b912eb256d1d6a9eab36286dea34d9f71a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMCT6J7J3OS4DTLMPNNX2BAVSX/bundle.json","state_url":"https://pith.science/pith/XMCT6J7J3OS4DTLMPNNX2BAVSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMCT6J7J3OS4DTLMPNNX2BAVSX/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-05-31T14:21:25Z","links":{"resolver":"https://pith.science/pith/XMCT6J7J3OS4DTLMPNNX2BAVSX","bundle":"https://pith.science/pith/XMCT6J7J3OS4DTLMPNNX2BAVSX/bundle.json","state":"https://pith.science/pith/XMCT6J7J3OS4DTLMPNNX2BAVSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMCT6J7J3OS4DTLMPNNX2BAVSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XMCT6J7J3OS4DTLMPNNX2BAVSX","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":"fd0ba59cda3aad7e1e98110e83fb3cda46e23cfbab7a7544a4bcb20e177353a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-08-04T00:10:40Z","title_canon_sha256":"655f6f39ed2471d464a88c5cdeef91517e80e9e70e7a412f419a238f04cff341"},"schema_version":"1.0","source":{"id":"1608.01399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01399","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01399v1","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01399","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"XMCT6J7J3OS4","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XMCT6J7J3OS4DTLM","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XMCT6J7J","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:f05c90e223cf653266960361b5dc8b912eb256d1d6a9eab36286dea34d9f71a1","target":"graph","created_at":"2026-05-18T01:09:52Z","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 consider the problem of finding an optimal statistical model for a given binary string. Following Kolmogorov, we use structure functions. In order to get concrete results, we replace Turing machines by finite automata and Kolmogorov complexity by Shallit and Wang's automatic complexity.\n  The $p$-value of a model for given data $x$ is the probability that there exists a model with as few states, accepting as few words, fitting uniformly randomly selected data $y$.\n  Deterministic and nondeterministic automata can give different optimal models. For $x=011\\, 110\\, 110\\, 11$, the best determin","authors_text":"Bj{\\o}rn Kjos-Hanssen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-08-04T00:10:40Z","title":"Few paths, fewer words: model selection with automatic structure functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01399","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:5a4786d9bfa634905274957cb455974c1d3d494cdf2a4619a07206d7b04970d9","target":"record","created_at":"2026-05-18T01:09:52Z","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":"fd0ba59cda3aad7e1e98110e83fb3cda46e23cfbab7a7544a4bcb20e177353a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-08-04T00:10:40Z","title_canon_sha256":"655f6f39ed2471d464a88c5cdeef91517e80e9e70e7a412f419a238f04cff341"},"schema_version":"1.0","source":{"id":"1608.01399","kind":"arxiv","version":1}},"canonical_sha256":"bb053f27e9dba5c1cd6c7b5b7d041595ccedb3b3a27836c1bdb5f547738b129b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb053f27e9dba5c1cd6c7b5b7d041595ccedb3b3a27836c1bdb5f547738b129b","first_computed_at":"2026-05-18T01:09:52.588152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:52.588152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TUESIBF2jF9WuiVUuZ28+eZAnERCAJJfR22I7UBif5vAc+gN2COUEN/4B9EgfOw5XAYG/StZU9Zj5WYX8nQbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:52.588728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a4786d9bfa634905274957cb455974c1d3d494cdf2a4619a07206d7b04970d9","sha256:f05c90e223cf653266960361b5dc8b912eb256d1d6a9eab36286dea34d9f71a1"],"state_sha256":"34966ada50418e71a54cc4ff8dcc2571f492f187ad555c9012092a51ad451026"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JAUFjWPknHEN286hMaiyjAeOcYr4cUh0ra47odNVC2hBLoAZ3QU46JSwbSqD/Bsj+Viuwp2C5F1k+xoI9YDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:21:25.384271Z","bundle_sha256":"5fb179028fc20f90ab6b83dd93f99ff33c540f3da9bdf4a06fa2c88feb91d782"}}