{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2S4FUHDKYG7GRY4X54F33TORPF","short_pith_number":"pith:2S4FUHDK","schema_version":"1.0","canonical_sha256":"d4b85a1c6ac1be68e397ef0bbdcdd17952020fc4493fbf6bb39531e5fdee366f","source":{"kind":"arxiv","id":"1401.2822","version":1},"attestation_state":"computed","paper":{"title":"Approximations for two-dimensional discrete scan statistics in some block-factor type dependent models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.CO","authors_text":"Alexandru Amarioarei, Cristian Preda","submitted_at":"2014-01-13T12:57:57Z","abstract_excerpt":"We consider the two-dimensional discrete scan statistic generated by a block-factor type model obtained from i.i.d. sequence. We present an approximation for the distribution of the scan statistics and the corresponding error bounds. A simulation study illustrates our methodology."},"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":"1401.2822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-01-13T12:57:57Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"6b59707db5f00552371b90ab11e9f60abb31b7a1ca20e072f34b688ceaa01294","abstract_canon_sha256":"86c9d8d081c947f9606bed545a3c7d65a0c17f1de9a4ce3b30829b58691aa84b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:31.884809Z","signature_b64":"/VvtcaOFHlL7izFd5uk6EYpsSwxsdFlArx0H+C1Pl0cjZf0Hh9Im+yKdDSZLvZFtJi310Plj4adbVytJvv2iAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4b85a1c6ac1be68e397ef0bbdcdd17952020fc4493fbf6bb39531e5fdee366f","last_reissued_at":"2026-05-18T03:02:31.883985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:31.883985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximations for two-dimensional discrete scan statistics in some block-factor type dependent models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.CO","authors_text":"Alexandru Amarioarei, Cristian Preda","submitted_at":"2014-01-13T12:57:57Z","abstract_excerpt":"We consider the two-dimensional discrete scan statistic generated by a block-factor type model obtained from i.i.d. sequence. We present an approximation for the distribution of the scan statistics and the corresponding error bounds. A simulation study illustrates our methodology."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2822","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.2822","created_at":"2026-05-18T03:02:31.884125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2822v1","created_at":"2026-05-18T03:02:31.884125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2822","created_at":"2026-05-18T03:02:31.884125+00:00"},{"alias_kind":"pith_short_12","alias_value":"2S4FUHDKYG7G","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2S4FUHDKYG7GRY4X","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2S4FUHDK","created_at":"2026-05-18T12:28:11.866339+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/2S4FUHDKYG7GRY4X54F33TORPF","json":"https://pith.science/pith/2S4FUHDKYG7GRY4X54F33TORPF.json","graph_json":"https://pith.science/api/pith-number/2S4FUHDKYG7GRY4X54F33TORPF/graph.json","events_json":"https://pith.science/api/pith-number/2S4FUHDKYG7GRY4X54F33TORPF/events.json","paper":"https://pith.science/paper/2S4FUHDK"},"agent_actions":{"view_html":"https://pith.science/pith/2S4FUHDKYG7GRY4X54F33TORPF","download_json":"https://pith.science/pith/2S4FUHDKYG7GRY4X54F33TORPF.json","view_paper":"https://pith.science/paper/2S4FUHDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2822&json=true","fetch_graph":"https://pith.science/api/pith-number/2S4FUHDKYG7GRY4X54F33TORPF/graph.json","fetch_events":"https://pith.science/api/pith-number/2S4FUHDKYG7GRY4X54F33TORPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2S4FUHDKYG7GRY4X54F33TORPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2S4FUHDKYG7GRY4X54F33TORPF/action/storage_attestation","attest_author":"https://pith.science/pith/2S4FUHDKYG7GRY4X54F33TORPF/action/author_attestation","sign_citation":"https://pith.science/pith/2S4FUHDKYG7GRY4X54F33TORPF/action/citation_signature","submit_replication":"https://pith.science/pith/2S4FUHDKYG7GRY4X54F33TORPF/action/replication_record"}},"created_at":"2026-05-18T03:02:31.884125+00:00","updated_at":"2026-05-18T03:02:31.884125+00:00"}