{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5356STYD3VQBMZL7KTVC6KPUS2","short_pith_number":"pith:5356STYD","canonical_record":{"source":{"id":"1602.05453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-02-17T15:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"92b76286d20bea487d0efbda0e264d7fc745e3d5976510d0a5d89bb19ec77137","abstract_canon_sha256":"57fca14e32adacaabb1a478482322de7633e91f3414b65171616babed14bf520"},"schema_version":"1.0"},"canonical_sha256":"eefbe94f03dd6016657f54ea2f29f496a914aa519d2b96c0457ec0c4c5e215cc","source":{"kind":"arxiv","id":"1602.05453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05453","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05453v1","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05453","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"5356STYD3VQB","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5356STYD3VQBMZL7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5356STYD","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5356STYD3VQBMZL7KTVC6KPUS2","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-02-17T15:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"92b76286d20bea487d0efbda0e264d7fc745e3d5976510d0a5d89bb19ec77137","abstract_canon_sha256":"57fca14e32adacaabb1a478482322de7633e91f3414b65171616babed14bf520"},"schema_version":"1.0"},"canonical_sha256":"eefbe94f03dd6016657f54ea2f29f496a914aa519d2b96c0457ec0c4c5e215cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:28.159393Z","signature_b64":"pwo0B4SgVUYXXgki79kJWQ00cn3JrV0sedGrdDcI/uxIX+lXmnblIRHKpVjt0AS0dcanZT0cun98SiCaEhVdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eefbe94f03dd6016657f54ea2f29f496a914aa519d2b96c0457ec0c4c5e215cc","last_reissued_at":"2026-05-18T01:20:28.158714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:28.158714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05453","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-18T01:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjJ4+uyh2BGvhbm+vWfi1mFUTIOJjfmNb9oQsbaRlN3cqbmTijGDxPcj9w9JAYuxB4IsTUkCiwoxzl4g6ELjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T13:49:33.478155Z"},"content_sha256":"25fc4c96cbe0b412f61955e94a405ff85e650930069d7ee4562871a31ee84430","schema_version":"1.0","event_id":"sha256:25fc4c96cbe0b412f61955e94a405ff85e650930069d7ee4562871a31ee84430"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5356STYD3VQBMZL7KTVC6KPUS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Stochastic Comparisons for Load-Sharing Series and Parallel Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Maxim Finkelstein, Nil Kamal Hazra","submitted_at":"2016-02-17T15:35:28Z","abstract_excerpt":"We study the allocation strategies for redundant components in the load-sharing series/parallel systems. We show that under the specified assumptions, the allocation of a redundant component to the stochastically weakest (strongest) component of a series (parallel) system is the best strategy to achieve its maximal reliability. The results have been studied under cumulative exposure model and for a general scenario as well. They have a clear intuitive meaning, however, the corresponding additional assumptions are not obvious, which can be seem from the proofs of our theorems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05453","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-18T01:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HxRw8IT8peHp3pc5W7XISrq8OnrdV6v1nKQS7G9mZZEdCReQLkoOLMK1LCcutZVjasYXN/zTFkx0o6mWUdb4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T13:49:33.478520Z"},"content_sha256":"aed9478072616a4f10f470056dfba485433ca923773392b682a5ffc0a99260d7","schema_version":"1.0","event_id":"sha256:aed9478072616a4f10f470056dfba485433ca923773392b682a5ffc0a99260d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5356STYD3VQBMZL7KTVC6KPUS2/bundle.json","state_url":"https://pith.science/pith/5356STYD3VQBMZL7KTVC6KPUS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5356STYD3VQBMZL7KTVC6KPUS2/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-07-01T13:49:33Z","links":{"resolver":"https://pith.science/pith/5356STYD3VQBMZL7KTVC6KPUS2","bundle":"https://pith.science/pith/5356STYD3VQBMZL7KTVC6KPUS2/bundle.json","state":"https://pith.science/pith/5356STYD3VQBMZL7KTVC6KPUS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5356STYD3VQBMZL7KTVC6KPUS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5356STYD3VQBMZL7KTVC6KPUS2","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":"57fca14e32adacaabb1a478482322de7633e91f3414b65171616babed14bf520","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-02-17T15:35:28Z","title_canon_sha256":"92b76286d20bea487d0efbda0e264d7fc745e3d5976510d0a5d89bb19ec77137"},"schema_version":"1.0","source":{"id":"1602.05453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05453","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05453v1","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05453","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"5356STYD3VQB","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5356STYD3VQBMZL7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5356STYD","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:aed9478072616a4f10f470056dfba485433ca923773392b682a5ffc0a99260d7","target":"graph","created_at":"2026-05-18T01:20:28Z","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":"We study the allocation strategies for redundant components in the load-sharing series/parallel systems. We show that under the specified assumptions, the allocation of a redundant component to the stochastically weakest (strongest) component of a series (parallel) system is the best strategy to achieve its maximal reliability. The results have been studied under cumulative exposure model and for a general scenario as well. They have a clear intuitive meaning, however, the corresponding additional assumptions are not obvious, which can be seem from the proofs of our theorems","authors_text":"Maxim Finkelstein, Nil Kamal Hazra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-02-17T15:35:28Z","title":"On Stochastic Comparisons for Load-Sharing Series and Parallel Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05453","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:25fc4c96cbe0b412f61955e94a405ff85e650930069d7ee4562871a31ee84430","target":"record","created_at":"2026-05-18T01:20:28Z","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":"57fca14e32adacaabb1a478482322de7633e91f3414b65171616babed14bf520","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-02-17T15:35:28Z","title_canon_sha256":"92b76286d20bea487d0efbda0e264d7fc745e3d5976510d0a5d89bb19ec77137"},"schema_version":"1.0","source":{"id":"1602.05453","kind":"arxiv","version":1}},"canonical_sha256":"eefbe94f03dd6016657f54ea2f29f496a914aa519d2b96c0457ec0c4c5e215cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eefbe94f03dd6016657f54ea2f29f496a914aa519d2b96c0457ec0c4c5e215cc","first_computed_at":"2026-05-18T01:20:28.158714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:28.158714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pwo0B4SgVUYXXgki79kJWQ00cn3JrV0sedGrdDcI/uxIX+lXmnblIRHKpVjt0AS0dcanZT0cun98SiCaEhVdAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:28.159393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25fc4c96cbe0b412f61955e94a405ff85e650930069d7ee4562871a31ee84430","sha256:aed9478072616a4f10f470056dfba485433ca923773392b682a5ffc0a99260d7"],"state_sha256":"41a6a86f5d7455c6b3a4c4fcb3aac4d7ff0a8977d373e83dcae8373926967d75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ka6KWHqeiSoWV2UEiWT3XCD1Um3avHjVUnEpfHjv4FQcNhaaZNAc+2rLnPwHbB6mLIfpwq/D++2er0SF+biJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T13:49:33.480486Z","bundle_sha256":"d0033831c9979392f55721f1950fdd23ddcd9e47b3963ebb1466cd14e5740d9f"}}