{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TFRFFNGUGIG2TBBNY7PEAG2VOU","short_pith_number":"pith:TFRFFNGU","canonical_record":{"source":{"id":"1212.2481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:55Z","cross_cats_sorted":[],"title_canon_sha256":"6e7d88f102384c1ecf6440caeef5ab3fa893c360315e15e0ddff5a5d423b989f","abstract_canon_sha256":"f610c187d636833f7e0c5e693ef346cae043c7e563760cfdd406b0862fbe0541"},"schema_version":"1.0"},"canonical_sha256":"996252b4d4320da9842dc7de401b55751b037b8b43636ca9cf27969c6dbd18bb","source":{"kind":"arxiv","id":"1212.2481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2481","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2481v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2481","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"TFRFFNGUGIG2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TFRFFNGUGIG2TBBN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TFRFFNGU","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TFRFFNGUGIG2TBBNY7PEAG2VOU","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:55Z","cross_cats_sorted":[],"title_canon_sha256":"6e7d88f102384c1ecf6440caeef5ab3fa893c360315e15e0ddff5a5d423b989f","abstract_canon_sha256":"f610c187d636833f7e0c5e693ef346cae043c7e563760cfdd406b0862fbe0541"},"schema_version":"1.0"},"canonical_sha256":"996252b4d4320da9842dc7de401b55751b037b8b43636ca9cf27969c6dbd18bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:44.667831Z","signature_b64":"LOMii3ALClqNEZ9zrX8gEhcMPOf1u6adcdn53rFvuD2epH2qJu7gpzZEW0oyZ+2eZ8FdAkJdh6OrVTz8kVNKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"996252b4d4320da9842dc7de401b55751b037b8b43636ca9cf27969c6dbd18bb","last_reissued_at":"2026-05-18T03:38:44.667025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:44.667025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2481","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ph9oKj219/6yII6wB/j5IMdC/1RVV16iNZiucsKaTyWtWVvamlKKrKKv5NMag+2pVG1JeXWJsuvg5Y3C47t+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:47:48.961533Z"},"content_sha256":"312a09064eb45e76108274a4065a44ad7a5915b212159df556f280c96c04320a","schema_version":"1.0","event_id":"sha256:312a09064eb45e76108274a4065a44ad7a5915b212159df556f280c96c04320a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TFRFFNGUGIG2TBBNY7PEAG2VOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monte-Carlo optimizations for resource allocation problems in stochastic network systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Milos Hauskrecht, Tomas Singliar","submitted_at":"2012-10-19T15:05:55Z","abstract_excerpt":"Real-world distributed systems and networks are often unreliable and subject     to random failures of its components. Such a stochastic behavior affects     adversely the complexity of optimization tasks performed routinely upon such     systems, in particular, various resource allocation tasks. In this work we     investigate and develop Monte Carlo solutions for a class of two-stage     optimization problems in stochastic networks in which the expected value of     resource allocations before and after stochastic failures needs to be     optimized. The limitation of these problems is that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2481","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bz6FRQvf3AwRu/mKxBgVADANitNxJBLQQaS3zHRenlzj+Xu8c1Krc53MH+pkljaNxMfs79pfb/qHQDQdGCtBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:47:48.961942Z"},"content_sha256":"631c4347bb630fe6b0d8f513aeb0124aad191447b6e6051e9d44ec2d75275bbf","schema_version":"1.0","event_id":"sha256:631c4347bb630fe6b0d8f513aeb0124aad191447b6e6051e9d44ec2d75275bbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFRFFNGUGIG2TBBNY7PEAG2VOU/bundle.json","state_url":"https://pith.science/pith/TFRFFNGUGIG2TBBNY7PEAG2VOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFRFFNGUGIG2TBBNY7PEAG2VOU/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-28T17:47:48Z","links":{"resolver":"https://pith.science/pith/TFRFFNGUGIG2TBBNY7PEAG2VOU","bundle":"https://pith.science/pith/TFRFFNGUGIG2TBBNY7PEAG2VOU/bundle.json","state":"https://pith.science/pith/TFRFFNGUGIG2TBBNY7PEAG2VOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFRFFNGUGIG2TBBNY7PEAG2VOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TFRFFNGUGIG2TBBNY7PEAG2VOU","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":"f610c187d636833f7e0c5e693ef346cae043c7e563760cfdd406b0862fbe0541","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:55Z","title_canon_sha256":"6e7d88f102384c1ecf6440caeef5ab3fa893c360315e15e0ddff5a5d423b989f"},"schema_version":"1.0","source":{"id":"1212.2481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2481","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2481v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2481","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"TFRFFNGUGIG2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TFRFFNGUGIG2TBBN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TFRFFNGU","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:631c4347bb630fe6b0d8f513aeb0124aad191447b6e6051e9d44ec2d75275bbf","target":"graph","created_at":"2026-05-18T03:38:44Z","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":"Real-world distributed systems and networks are often unreliable and subject     to random failures of its components. Such a stochastic behavior affects     adversely the complexity of optimization tasks performed routinely upon such     systems, in particular, various resource allocation tasks. In this work we     investigate and develop Monte Carlo solutions for a class of two-stage     optimization problems in stochastic networks in which the expected value of     resource allocations before and after stochastic failures needs to be     optimized. The limitation of these problems is that t","authors_text":"Milos Hauskrecht, Tomas Singliar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:55Z","title":"Monte-Carlo optimizations for resource allocation problems in stochastic network systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2481","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:312a09064eb45e76108274a4065a44ad7a5915b212159df556f280c96c04320a","target":"record","created_at":"2026-05-18T03:38:44Z","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":"f610c187d636833f7e0c5e693ef346cae043c7e563760cfdd406b0862fbe0541","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:55Z","title_canon_sha256":"6e7d88f102384c1ecf6440caeef5ab3fa893c360315e15e0ddff5a5d423b989f"},"schema_version":"1.0","source":{"id":"1212.2481","kind":"arxiv","version":1}},"canonical_sha256":"996252b4d4320da9842dc7de401b55751b037b8b43636ca9cf27969c6dbd18bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"996252b4d4320da9842dc7de401b55751b037b8b43636ca9cf27969c6dbd18bb","first_computed_at":"2026-05-18T03:38:44.667025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:44.667025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LOMii3ALClqNEZ9zrX8gEhcMPOf1u6adcdn53rFvuD2epH2qJu7gpzZEW0oyZ+2eZ8FdAkJdh6OrVTz8kVNKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:44.667831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:312a09064eb45e76108274a4065a44ad7a5915b212159df556f280c96c04320a","sha256:631c4347bb630fe6b0d8f513aeb0124aad191447b6e6051e9d44ec2d75275bbf"],"state_sha256":"832976decbb7d96933759d2236ebd99b5a1c2dedbdf981e3f8d2fe43633fbc23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/nYXlJwzv+VyQVJ7kLj6nsrSZYOa1hiqHH14uCVgkz3wONmjcXZuqgUGovhHaTAIYM1yKNJN+OnQ89DaEjGjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:47:48.963745Z","bundle_sha256":"94cd74299bf01648da1b2b01df6488c6ddd17977c6623e803bd75c3ce176e4a9"}}