{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6KDPFSH2FBCC364ADNQURNW3TJ","short_pith_number":"pith:6KDPFSH2","canonical_record":{"source":{"id":"1306.3815","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-17T11:26:34Z","cross_cats_sorted":[],"title_canon_sha256":"149655e4a5ecb4c5678000af7ae5607eb64b2922af2708ced52ab9ec58cfe084","abstract_canon_sha256":"37ee21ce8c087140d82c79a6d6e8148f8850515c017a0aa41c2d3848e25a95b5"},"schema_version":"1.0"},"canonical_sha256":"f286f2c8fa28442dfb801b6148b6db9a4b68c8daaf93a9769e5d3abd5db729c2","source":{"kind":"arxiv","id":"1306.3815","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3815","created_at":"2026-05-18T02:39:01Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3815v3","created_at":"2026-05-18T02:39:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3815","created_at":"2026-05-18T02:39:01Z"},{"alias_kind":"pith_short_12","alias_value":"6KDPFSH2FBCC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6KDPFSH2FBCC364A","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6KDPFSH2","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6KDPFSH2FBCC364ADNQURNW3TJ","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3815","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-17T11:26:34Z","cross_cats_sorted":[],"title_canon_sha256":"149655e4a5ecb4c5678000af7ae5607eb64b2922af2708ced52ab9ec58cfe084","abstract_canon_sha256":"37ee21ce8c087140d82c79a6d6e8148f8850515c017a0aa41c2d3848e25a95b5"},"schema_version":"1.0"},"canonical_sha256":"f286f2c8fa28442dfb801b6148b6db9a4b68c8daaf93a9769e5d3abd5db729c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:01.325196Z","signature_b64":"uLPajjPc9bPQeoTlfOrnxvfA+vzS0hFI07g06H6vh+mznLSnRG0UUgM7LRnxWsf4DNxz8g4wLtWMRDxPN7MPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f286f2c8fa28442dfb801b6148b6db9a4b68c8daaf93a9769e5d3abd5db729c2","last_reissued_at":"2026-05-18T02:39:01.324693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:01.324693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3815","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-18T02:39:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXSDD1PLi8N7QLl9zWF5h21wrMrs2a/JoAJbQIxi0xnuFv+FgQ0W4qKztriEwE7bDzKI3xtkmtOS4YXStmSWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:27:18.339061Z"},"content_sha256":"1fd38278beeba19125b08e1a9d654df2bbfe2329ceaf9c82aa4527f7337256a0","schema_version":"1.0","event_id":"sha256:1fd38278beeba19125b08e1a9d654df2bbfe2329ceaf9c82aa4527f7337256a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6KDPFSH2FBCC364ADNQURNW3TJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"H. Heitsch, H. Le\\\"ovey, W. R\\\"omisch","submitted_at":"2013-06-17T11:26:34Z","abstract_excerpt":"Quasi-Monte Carlo algorithms are studied for designing discrete approximations of two-stage linear stochastic programs. Their integrands are piecewise linear, but neither smooth nor lie in the function spaces considered for QMC error analysis. We show that under some weak geometric condition on the two-stage model all terms of their ANOVA decomposition, except the one of highest order, are smooth. Hence, Quasi-Monte Carlo algorithms may achieve the optimal rate of convergence $O(n^{-1+\\delta})$ with $\\delta \\in(0,\\frac{1}{2}]$ and a constant not depending on the dimension. The geometric condit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3815","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-18T02:39:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zhoWUymIp4hE2IoL7LtsJQtBAJ2XOs5N6KHLgL4bWHx/HYuoqBtE2tWaT8QInRYQl48M3VhWsPJUQCBKHT9nAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:27:18.339428Z"},"content_sha256":"b0a664a673e22aa72a07ef15eb5da406e170942cc544fe6805f227a95aa25008","schema_version":"1.0","event_id":"sha256:b0a664a673e22aa72a07ef15eb5da406e170942cc544fe6805f227a95aa25008"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KDPFSH2FBCC364ADNQURNW3TJ/bundle.json","state_url":"https://pith.science/pith/6KDPFSH2FBCC364ADNQURNW3TJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KDPFSH2FBCC364ADNQURNW3TJ/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-05T08:27:18Z","links":{"resolver":"https://pith.science/pith/6KDPFSH2FBCC364ADNQURNW3TJ","bundle":"https://pith.science/pith/6KDPFSH2FBCC364ADNQURNW3TJ/bundle.json","state":"https://pith.science/pith/6KDPFSH2FBCC364ADNQURNW3TJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KDPFSH2FBCC364ADNQURNW3TJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6KDPFSH2FBCC364ADNQURNW3TJ","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":"37ee21ce8c087140d82c79a6d6e8148f8850515c017a0aa41c2d3848e25a95b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-17T11:26:34Z","title_canon_sha256":"149655e4a5ecb4c5678000af7ae5607eb64b2922af2708ced52ab9ec58cfe084"},"schema_version":"1.0","source":{"id":"1306.3815","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3815","created_at":"2026-05-18T02:39:01Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3815v3","created_at":"2026-05-18T02:39:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3815","created_at":"2026-05-18T02:39:01Z"},{"alias_kind":"pith_short_12","alias_value":"6KDPFSH2FBCC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6KDPFSH2FBCC364A","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6KDPFSH2","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:b0a664a673e22aa72a07ef15eb5da406e170942cc544fe6805f227a95aa25008","target":"graph","created_at":"2026-05-18T02:39:01Z","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":"Quasi-Monte Carlo algorithms are studied for designing discrete approximations of two-stage linear stochastic programs. Their integrands are piecewise linear, but neither smooth nor lie in the function spaces considered for QMC error analysis. We show that under some weak geometric condition on the two-stage model all terms of their ANOVA decomposition, except the one of highest order, are smooth. Hence, Quasi-Monte Carlo algorithms may achieve the optimal rate of convergence $O(n^{-1+\\delta})$ with $\\delta \\in(0,\\frac{1}{2}]$ and a constant not depending on the dimension. The geometric condit","authors_text":"H. Heitsch, H. Le\\\"ovey, W. R\\\"omisch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-17T11:26:34Z","title":"Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3815","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:1fd38278beeba19125b08e1a9d654df2bbfe2329ceaf9c82aa4527f7337256a0","target":"record","created_at":"2026-05-18T02:39:01Z","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":"37ee21ce8c087140d82c79a6d6e8148f8850515c017a0aa41c2d3848e25a95b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-17T11:26:34Z","title_canon_sha256":"149655e4a5ecb4c5678000af7ae5607eb64b2922af2708ced52ab9ec58cfe084"},"schema_version":"1.0","source":{"id":"1306.3815","kind":"arxiv","version":3}},"canonical_sha256":"f286f2c8fa28442dfb801b6148b6db9a4b68c8daaf93a9769e5d3abd5db729c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f286f2c8fa28442dfb801b6148b6db9a4b68c8daaf93a9769e5d3abd5db729c2","first_computed_at":"2026-05-18T02:39:01.324693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:01.324693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uLPajjPc9bPQeoTlfOrnxvfA+vzS0hFI07g06H6vh+mznLSnRG0UUgM7LRnxWsf4DNxz8g4wLtWMRDxPN7MPAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:01.325196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3815","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fd38278beeba19125b08e1a9d654df2bbfe2329ceaf9c82aa4527f7337256a0","sha256:b0a664a673e22aa72a07ef15eb5da406e170942cc544fe6805f227a95aa25008"],"state_sha256":"3d749382e42d7f7924b83d952b1b8815aa2e5a8481dbe1ec9f7d67894ccb9705"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InjCdhxOy//vW3JdexTmvARoknuCr8UH0Tt71FCFc9NAeu/CB09JsBPlQ4a6dXQ0h/EWjA61kc+9W//qkRMSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:27:18.341326Z","bundle_sha256":"74f35d7efeae38a859e553e4c7b385725076527c25bf2e120ad3fc89f9487030"}}