{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:36DKPHPFALPLIT655B55NNWIHI","short_pith_number":"pith:36DKPHPF","schema_version":"1.0","canonical_sha256":"df86a79de502deb44fdde87bd6b6c83a31e2dcde2a08b83b939079c89ff6f5fa","source":{"kind":"arxiv","id":"1107.0312","version":3},"attestation_state":"computed","paper":{"title":"Approximate group context tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Alexandre Belloni, Roberto I. Oliveira","submitted_at":"2011-07-01T19:57:21Z","abstract_excerpt":"We study a variable length Markov chain model associated with a group of stationary processes that share the same context tree but each process has potentially different conditional probabilities. We propose a new model selection and estimation method which is computationally efficient. We develop oracle and adaptivity inequalities, as well as model selection properties, that hold under continuity of the transition probabilities and polynomial $\\beta$-mixing. In particular, model misspecification is allowed.\n  These results are applied to interesting families of processes. For Markov processes"},"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":"1107.0312","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-07-01T19:57:21Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"d4026f57ad4e61c10b25de57633966c46f9cff90c0bdb8dccf2c1ed0c696d384","abstract_canon_sha256":"5c30ce6c5dbfd7baa843d5a4df21ee358182b4b2338040858f0aac858088e18b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:33.900492Z","signature_b64":"0q793aCORVZir+oODF2znV1EvPaJCXNdkP3jpvw4pEOlVmrrdacTEr2L6CgmNUl10Amf+jtijNu15fv+ZusGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df86a79de502deb44fdde87bd6b6c83a31e2dcde2a08b83b939079c89ff6f5fa","last_reissued_at":"2026-05-18T01:23:33.899669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:33.899669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate group context tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Alexandre Belloni, Roberto I. Oliveira","submitted_at":"2011-07-01T19:57:21Z","abstract_excerpt":"We study a variable length Markov chain model associated with a group of stationary processes that share the same context tree but each process has potentially different conditional probabilities. We propose a new model selection and estimation method which is computationally efficient. We develop oracle and adaptivity inequalities, as well as model selection properties, that hold under continuity of the transition probabilities and polynomial $\\beta$-mixing. In particular, model misspecification is allowed.\n  These results are applied to interesting families of processes. For Markov processes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0312","kind":"arxiv","version":3},"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":"1107.0312","created_at":"2026-05-18T01:23:33.899787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.0312v3","created_at":"2026-05-18T01:23:33.899787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0312","created_at":"2026-05-18T01:23:33.899787+00:00"},{"alias_kind":"pith_short_12","alias_value":"36DKPHPFALPL","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"36DKPHPFALPLIT65","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"36DKPHPF","created_at":"2026-05-18T12:26:18.847500+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/36DKPHPFALPLIT655B55NNWIHI","json":"https://pith.science/pith/36DKPHPFALPLIT655B55NNWIHI.json","graph_json":"https://pith.science/api/pith-number/36DKPHPFALPLIT655B55NNWIHI/graph.json","events_json":"https://pith.science/api/pith-number/36DKPHPFALPLIT655B55NNWIHI/events.json","paper":"https://pith.science/paper/36DKPHPF"},"agent_actions":{"view_html":"https://pith.science/pith/36DKPHPFALPLIT655B55NNWIHI","download_json":"https://pith.science/pith/36DKPHPFALPLIT655B55NNWIHI.json","view_paper":"https://pith.science/paper/36DKPHPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.0312&json=true","fetch_graph":"https://pith.science/api/pith-number/36DKPHPFALPLIT655B55NNWIHI/graph.json","fetch_events":"https://pith.science/api/pith-number/36DKPHPFALPLIT655B55NNWIHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36DKPHPFALPLIT655B55NNWIHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36DKPHPFALPLIT655B55NNWIHI/action/storage_attestation","attest_author":"https://pith.science/pith/36DKPHPFALPLIT655B55NNWIHI/action/author_attestation","sign_citation":"https://pith.science/pith/36DKPHPFALPLIT655B55NNWIHI/action/citation_signature","submit_replication":"https://pith.science/pith/36DKPHPFALPLIT655B55NNWIHI/action/replication_record"}},"created_at":"2026-05-18T01:23:33.899787+00:00","updated_at":"2026-05-18T01:23:33.899787+00:00"}