{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4IT6F5JG57SOO45ESDVPPBUEW6","short_pith_number":"pith:4IT6F5JG","canonical_record":{"source":{"id":"1301.2459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-01-11T11:31:06Z","cross_cats_sorted":[],"title_canon_sha256":"f3a77b54207287d693686ea5ce237731d179762a0d971631a43eac82f21ad8cb","abstract_canon_sha256":"817f41770fa7e8cc278027e0f67e09da1a474086ad6a4f7c47e57f95c7ece4ba"},"schema_version":"1.0"},"canonical_sha256":"e227e2f526efe4e773a490eaf78684b7b8e75b3f2f77d6b82e0add79c6a45d06","source":{"kind":"arxiv","id":"1301.2459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2459","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2459v1","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2459","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"4IT6F5JG57SO","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4IT6F5JG57SOO45E","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4IT6F5JG","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4IT6F5JG57SOO45ESDVPPBUEW6","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-01-11T11:31:06Z","cross_cats_sorted":[],"title_canon_sha256":"f3a77b54207287d693686ea5ce237731d179762a0d971631a43eac82f21ad8cb","abstract_canon_sha256":"817f41770fa7e8cc278027e0f67e09da1a474086ad6a4f7c47e57f95c7ece4ba"},"schema_version":"1.0"},"canonical_sha256":"e227e2f526efe4e773a490eaf78684b7b8e75b3f2f77d6b82e0add79c6a45d06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:37.870967Z","signature_b64":"229pREK6EZxegt/FMgy32zYu1/7EtWRqKt5DJwUT4RrkOtTBBnXCxptjmWaz9Qyxvu6fJxbFbBQkJjsz2UjmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e227e2f526efe4e773a490eaf78684b7b8e75b3f2f77d6b82e0add79c6a45d06","last_reissued_at":"2026-05-18T03:36:37.870516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:37.870516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2459","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-18T03:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Dq/N5LbOXPqc6GefUkGJJhooS9upfyLWt6LT3SOZz4QRGm+6VO6WTDN5m1L/e/xv42yYMVSPXQA/0ApNzOLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:35:10.263744Z"},"content_sha256":"8a1ffdfc03f9e247d0d30c889377e8251066c1df26519515f12f8bf2d5a9ea1f","schema_version":"1.0","event_id":"sha256:8a1ffdfc03f9e247d0d30c889377e8251066c1df26519515f12f8bf2d5a9ea1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4IT6F5JG57SOO45ESDVPPBUEW6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gap bootstrap methods for massive data sets with an application to transportation engineering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"C. Spiegelman, J. Appiah, L. Rilett, S. N. Lahiri","submitted_at":"2013-01-11T11:31:06Z","abstract_excerpt":"In this paper we describe two bootstrap methods for massive data sets. Naive applications of common resampling methodology are often impractical for massive data sets due to computational burden and due to complex patterns of inhomogeneity. In contrast, the proposed methods exploit certain structural properties of a large class of massive data sets to break up the original problem into a set of simpler subproblems, solve each subproblem separately where the data exhibit approximate uniformity and where computational complexity can be reduced to a manageable level, and then combine the results "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2459","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-18T03:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DSSQTB0tqFoWbyByQeAYy7MLXRium3eiGgcuqy/5JuXYueFvSWYLGRu5d4YDdqRtjVFClfMQzdxx2yzaNf8bAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:35:10.264303Z"},"content_sha256":"67de7e1238dcdeb7ab0a010208ba88836d32240a2adc30b5fa8f2b8691a8e702","schema_version":"1.0","event_id":"sha256:67de7e1238dcdeb7ab0a010208ba88836d32240a2adc30b5fa8f2b8691a8e702"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IT6F5JG57SOO45ESDVPPBUEW6/bundle.json","state_url":"https://pith.science/pith/4IT6F5JG57SOO45ESDVPPBUEW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IT6F5JG57SOO45ESDVPPBUEW6/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-30T21:35:10Z","links":{"resolver":"https://pith.science/pith/4IT6F5JG57SOO45ESDVPPBUEW6","bundle":"https://pith.science/pith/4IT6F5JG57SOO45ESDVPPBUEW6/bundle.json","state":"https://pith.science/pith/4IT6F5JG57SOO45ESDVPPBUEW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IT6F5JG57SOO45ESDVPPBUEW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4IT6F5JG57SOO45ESDVPPBUEW6","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":"817f41770fa7e8cc278027e0f67e09da1a474086ad6a4f7c47e57f95c7ece4ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-01-11T11:31:06Z","title_canon_sha256":"f3a77b54207287d693686ea5ce237731d179762a0d971631a43eac82f21ad8cb"},"schema_version":"1.0","source":{"id":"1301.2459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2459","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2459v1","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2459","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"4IT6F5JG57SO","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4IT6F5JG57SOO45E","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4IT6F5JG","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:67de7e1238dcdeb7ab0a010208ba88836d32240a2adc30b5fa8f2b8691a8e702","target":"graph","created_at":"2026-05-18T03:36:37Z","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":"In this paper we describe two bootstrap methods for massive data sets. Naive applications of common resampling methodology are often impractical for massive data sets due to computational burden and due to complex patterns of inhomogeneity. In contrast, the proposed methods exploit certain structural properties of a large class of massive data sets to break up the original problem into a set of simpler subproblems, solve each subproblem separately where the data exhibit approximate uniformity and where computational complexity can be reduced to a manageable level, and then combine the results ","authors_text":"C. Spiegelman, J. Appiah, L. Rilett, S. N. Lahiri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-01-11T11:31:06Z","title":"Gap bootstrap methods for massive data sets with an application to transportation engineering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2459","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:8a1ffdfc03f9e247d0d30c889377e8251066c1df26519515f12f8bf2d5a9ea1f","target":"record","created_at":"2026-05-18T03:36:37Z","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":"817f41770fa7e8cc278027e0f67e09da1a474086ad6a4f7c47e57f95c7ece4ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-01-11T11:31:06Z","title_canon_sha256":"f3a77b54207287d693686ea5ce237731d179762a0d971631a43eac82f21ad8cb"},"schema_version":"1.0","source":{"id":"1301.2459","kind":"arxiv","version":1}},"canonical_sha256":"e227e2f526efe4e773a490eaf78684b7b8e75b3f2f77d6b82e0add79c6a45d06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e227e2f526efe4e773a490eaf78684b7b8e75b3f2f77d6b82e0add79c6a45d06","first_computed_at":"2026-05-18T03:36:37.870516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:37.870516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"229pREK6EZxegt/FMgy32zYu1/7EtWRqKt5DJwUT4RrkOtTBBnXCxptjmWaz9Qyxvu6fJxbFbBQkJjsz2UjmCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:37.870967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a1ffdfc03f9e247d0d30c889377e8251066c1df26519515f12f8bf2d5a9ea1f","sha256:67de7e1238dcdeb7ab0a010208ba88836d32240a2adc30b5fa8f2b8691a8e702"],"state_sha256":"73b3e4568ee2b2eb076932657fe2c9f82291a772880c74202c82a3947bdd80ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONoPgT49q6QTPU15x6r2wJwqBoY2bYoJ0gM1Zb0TZXF0XjJOtVeNbCWKmU8qVu8nEi+4U5wfJ/g6d6H7cE/FCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:35:10.267902Z","bundle_sha256":"a12e1a47f74f4272a48f47b2f94cbaf103503f15129dd03fee97f415d3eade81"}}