{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LMKDL56W6DOB2ROTS4ZGSMW4TQ","short_pith_number":"pith:LMKDL56W","canonical_record":{"source":{"id":"1707.02555","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-09T10:24:53Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"d86f199423f85b277fef266b8a3e28d858ae06e72038f560c17b08e65570f29b","abstract_canon_sha256":"2a49861df91e58ec0c093a963bd6e68aec7b2ce2792deafa9de9c7eee33bea27"},"schema_version":"1.0"},"canonical_sha256":"5b1435f7d6f0dc1d45d397326932dc9c1052d1e8d1e6e3d6912df8714bc04095","source":{"kind":"arxiv","id":"1707.02555","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02555","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02555v3","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02555","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"LMKDL56W6DOB","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LMKDL56W6DOB2ROT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LMKDL56W","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LMKDL56W6DOB2ROTS4ZGSMW4TQ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02555","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-09T10:24:53Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"d86f199423f85b277fef266b8a3e28d858ae06e72038f560c17b08e65570f29b","abstract_canon_sha256":"2a49861df91e58ec0c093a963bd6e68aec7b2ce2792deafa9de9c7eee33bea27"},"schema_version":"1.0"},"canonical_sha256":"5b1435f7d6f0dc1d45d397326932dc9c1052d1e8d1e6e3d6912df8714bc04095","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.753089Z","signature_b64":"vpB2ei4jMjbkWrvD/RgZIFs+6F0otQia89YK/4D5Vn6SrghdQ+tIRGM1eTNJ7+fB/fol49IE96NqOHd4qMGDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b1435f7d6f0dc1d45d397326932dc9c1052d1e8d1e6e3d6912df8714bc04095","last_reissued_at":"2026-05-18T00:22:39.752680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.752680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02555","source_version":3,"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-18T00:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EI4OIaerEpRRBZFfoP+rilHKGKzzvrUi9X32pVu2+aTdmsbt2DctOD9nJky+AfzDd3IUpfY7it+BjifnzUjTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:18:44.595484Z"},"content_sha256":"9580dfe4b4e0f8bd032888232bbcb5a5f1e075802b5e99667530664c2f88ffe1","schema_version":"1.0","event_id":"sha256:9580dfe4b4e0f8bd032888232bbcb5a5f1e075802b5e99667530664c2f88ffe1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LMKDL56W6DOB2ROTS4ZGSMW4TQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Theory for the Maximum of an Increasing Sequence of Parametric Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Jonathan B. Hill","submitted_at":"2017-07-09T10:24:53Z","abstract_excerpt":"\\cite{HillMotegi2017} present a new general asymptotic theory for the maximum of a random array $\\{\\mathcal{X}_{n}(i)$ $:$ $1$ $\\leq $ $i$ $\\leq $ $\\mathcal{L}\\}_{n\\geq 1}$, where each $\\mathcal{X}_{n}(i)$ is assumed to converge in probability as $n$ $\\rightarrow $ $\\infty $. The array dimension $\\mathcal{L}$ is allowed to increase with the sample size $n$. Existing extreme value theory arguments focus on observed data $\\mathcal{X}_{n}(i)$, and require a well defined limit law for $\\max_{1\\leq i\\leq \\mathcal{L}}|\\mathcal{X}_{n}(i)|$ by restricting dependence across $i$. The high dimensional ce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02555","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"},"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-18T00:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nc9pzHufsvL+SZOtKyWYP0c34YdBCeigSXn2URxxljgd9Klg2c7NlS16qdi1fbQfarZBFSJSUa5vrYl9DMmiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:18:44.595828Z"},"content_sha256":"46a3eac7716ec107c68a820f48743303c38b2d66d52a89dbba9e48eb324556d6","schema_version":"1.0","event_id":"sha256:46a3eac7716ec107c68a820f48743303c38b2d66d52a89dbba9e48eb324556d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMKDL56W6DOB2ROTS4ZGSMW4TQ/bundle.json","state_url":"https://pith.science/pith/LMKDL56W6DOB2ROTS4ZGSMW4TQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMKDL56W6DOB2ROTS4ZGSMW4TQ/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-10T19:18:44Z","links":{"resolver":"https://pith.science/pith/LMKDL56W6DOB2ROTS4ZGSMW4TQ","bundle":"https://pith.science/pith/LMKDL56W6DOB2ROTS4ZGSMW4TQ/bundle.json","state":"https://pith.science/pith/LMKDL56W6DOB2ROTS4ZGSMW4TQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMKDL56W6DOB2ROTS4ZGSMW4TQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LMKDL56W6DOB2ROTS4ZGSMW4TQ","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":"2a49861df91e58ec0c093a963bd6e68aec7b2ce2792deafa9de9c7eee33bea27","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-09T10:24:53Z","title_canon_sha256":"d86f199423f85b277fef266b8a3e28d858ae06e72038f560c17b08e65570f29b"},"schema_version":"1.0","source":{"id":"1707.02555","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02555","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02555v3","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02555","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"LMKDL56W6DOB","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LMKDL56W6DOB2ROT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LMKDL56W","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:46a3eac7716ec107c68a820f48743303c38b2d66d52a89dbba9e48eb324556d6","target":"graph","created_at":"2026-05-18T00:22:39Z","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":"\\cite{HillMotegi2017} present a new general asymptotic theory for the maximum of a random array $\\{\\mathcal{X}_{n}(i)$ $:$ $1$ $\\leq $ $i$ $\\leq $ $\\mathcal{L}\\}_{n\\geq 1}$, where each $\\mathcal{X}_{n}(i)$ is assumed to converge in probability as $n$ $\\rightarrow $ $\\infty $. The array dimension $\\mathcal{L}$ is allowed to increase with the sample size $n$. Existing extreme value theory arguments focus on observed data $\\mathcal{X}_{n}(i)$, and require a well defined limit law for $\\max_{1\\leq i\\leq \\mathcal{L}}|\\mathcal{X}_{n}(i)|$ by restricting dependence across $i$. The high dimensional ce","authors_text":"Jonathan B. Hill","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-09T10:24:53Z","title":"Asymptotic Theory for the Maximum of an Increasing Sequence of Parametric Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02555","kind":"arxiv","version":3},"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:9580dfe4b4e0f8bd032888232bbcb5a5f1e075802b5e99667530664c2f88ffe1","target":"record","created_at":"2026-05-18T00:22:39Z","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":"2a49861df91e58ec0c093a963bd6e68aec7b2ce2792deafa9de9c7eee33bea27","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-09T10:24:53Z","title_canon_sha256":"d86f199423f85b277fef266b8a3e28d858ae06e72038f560c17b08e65570f29b"},"schema_version":"1.0","source":{"id":"1707.02555","kind":"arxiv","version":3}},"canonical_sha256":"5b1435f7d6f0dc1d45d397326932dc9c1052d1e8d1e6e3d6912df8714bc04095","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b1435f7d6f0dc1d45d397326932dc9c1052d1e8d1e6e3d6912df8714bc04095","first_computed_at":"2026-05-18T00:22:39.752680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:39.752680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vpB2ei4jMjbkWrvD/RgZIFs+6F0otQia89YK/4D5Vn6SrghdQ+tIRGM1eTNJ7+fB/fol49IE96NqOHd4qMGDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:39.753089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02555","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9580dfe4b4e0f8bd032888232bbcb5a5f1e075802b5e99667530664c2f88ffe1","sha256:46a3eac7716ec107c68a820f48743303c38b2d66d52a89dbba9e48eb324556d6"],"state_sha256":"40e5dbfda99c93876d369b68879dd39b2e6ed739f088ec60e869d875c2aa59ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDCTgZqLwN9iX6wcW2FrdFNq2htrvRscdQ4wa9ZWNcR7ty7beLx6BAgWlhhTpGoL5/vq9P02mRjU8t+7OiuTDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:18:44.597709Z","bundle_sha256":"51a55f3ce3130f90140eeb2be36cdf4a89608b3e5dc75cf7bdca542969326126"}}