{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:37MQXIN5DF5EG6FPU62MK4C3UF","short_pith_number":"pith:37MQXIN5","canonical_record":{"source":{"id":"1307.3621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-13T07:41:01Z","cross_cats_sorted":[],"title_canon_sha256":"2352d8d22fa7a9c4a8d15bc58001775b3c7f7209f3fce9001a86ee0719531646","abstract_canon_sha256":"043d3402366a5409edfc20368d740e7ae21392274148b3cbdae9be54e26cd37e"},"schema_version":"1.0"},"canonical_sha256":"dfd90ba1bd197a4378afa7b4c5705ba16b7e93d1037e9df2bc51979503d9cb45","source":{"kind":"arxiv","id":"1307.3621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3621","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3621v1","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3621","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"37MQXIN5DF5E","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"37MQXIN5DF5EG6FP","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"37MQXIN5","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:37MQXIN5DF5EG6FPU62MK4C3UF","target":"record","payload":{"canonical_record":{"source":{"id":"1307.3621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-13T07:41:01Z","cross_cats_sorted":[],"title_canon_sha256":"2352d8d22fa7a9c4a8d15bc58001775b3c7f7209f3fce9001a86ee0719531646","abstract_canon_sha256":"043d3402366a5409edfc20368d740e7ae21392274148b3cbdae9be54e26cd37e"},"schema_version":"1.0"},"canonical_sha256":"dfd90ba1bd197a4378afa7b4c5705ba16b7e93d1037e9df2bc51979503d9cb45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:28.373673Z","signature_b64":"3h7Vyw631g0mmycPuK60mOdVVkVegQhkz2kvJcczC8z1YbGDEXkJkBZYoNf6/6EatusCaifz/LvvRhyRWBC7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfd90ba1bd197a4378afa7b4c5705ba16b7e93d1037e9df2bc51979503d9cb45","last_reissued_at":"2026-05-18T03:18:28.373007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:28.373007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.3621","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:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2DxWTQbmvbCGZ7K4MppSyqkY1pa23KL/zvQQ7FGe0FX5TXBgoCfx2J1AADHK15z/I+ftbhkWzxhZvEbFC1oBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:24:07.492267Z"},"content_sha256":"38651674ac3d8d6a2af83ceefb8db6fa74aab855ebef261a31040b0c05dff2ae","schema_version":"1.0","event_id":"sha256:38651674ac3d8d6a2af83ceefb8db6fa74aab855ebef261a31040b0c05dff2ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:37MQXIN5DF5EG6FPU62MK4C3UF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anindya De, Ankur Moitra, Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio","submitted_at":"2013-07-13T07:41:01Z","abstract_excerpt":"We consider a problem which has received considerable attention in systems literature because of its applications to routing in delay tolerant networks and replica placement in distributed storage systems. In abstract terms the problem can be stated as follows: Given a random variable $X$ generated by a known product distribution over $\\{0,1\\}^n$ and a target value $0 \\leq \\theta \\leq 1$, output a non-negative vector $w$, with $\\|w\\|_1 \\le 1$, which maximizes the probability of the event $w \\cdot X \\ge \\theta$. This is a challenging non-convex optimization problem for which even computing the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3621","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:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4QzzHOdJk22YOIsv3+KqbUYD+g2l5jqqsL88B7aNlbciXxts28KKUZSXh7bwTvroc/SlmTGdkDLmbZh2hgd4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:24:07.492669Z"},"content_sha256":"f7f8d0316c1f43f85c2f135476adec12499e86fef02f6f0b5ce1e161620ea78e","schema_version":"1.0","event_id":"sha256:f7f8d0316c1f43f85c2f135476adec12499e86fef02f6f0b5ce1e161620ea78e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF/bundle.json","state_url":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37MQXIN5DF5EG6FPU62MK4C3UF/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-27T11:24:07Z","links":{"resolver":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF","bundle":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF/bundle.json","state":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37MQXIN5DF5EG6FPU62MK4C3UF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:37MQXIN5DF5EG6FPU62MK4C3UF","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":"043d3402366a5409edfc20368d740e7ae21392274148b3cbdae9be54e26cd37e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-13T07:41:01Z","title_canon_sha256":"2352d8d22fa7a9c4a8d15bc58001775b3c7f7209f3fce9001a86ee0719531646"},"schema_version":"1.0","source":{"id":"1307.3621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3621","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3621v1","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3621","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"37MQXIN5DF5E","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"37MQXIN5DF5EG6FP","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"37MQXIN5","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:f7f8d0316c1f43f85c2f135476adec12499e86fef02f6f0b5ce1e161620ea78e","target":"graph","created_at":"2026-05-18T03:18: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 consider a problem which has received considerable attention in systems literature because of its applications to routing in delay tolerant networks and replica placement in distributed storage systems. In abstract terms the problem can be stated as follows: Given a random variable $X$ generated by a known product distribution over $\\{0,1\\}^n$ and a target value $0 \\leq \\theta \\leq 1$, output a non-negative vector $w$, with $\\|w\\|_1 \\le 1$, which maximizes the probability of the event $w \\cdot X \\ge \\theta$. This is a challenging non-convex optimization problem for which even computing the ","authors_text":"Anindya De, Ankur Moitra, Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-13T07:41:01Z","title":"A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3621","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:38651674ac3d8d6a2af83ceefb8db6fa74aab855ebef261a31040b0c05dff2ae","target":"record","created_at":"2026-05-18T03:18: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":"043d3402366a5409edfc20368d740e7ae21392274148b3cbdae9be54e26cd37e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-13T07:41:01Z","title_canon_sha256":"2352d8d22fa7a9c4a8d15bc58001775b3c7f7209f3fce9001a86ee0719531646"},"schema_version":"1.0","source":{"id":"1307.3621","kind":"arxiv","version":1}},"canonical_sha256":"dfd90ba1bd197a4378afa7b4c5705ba16b7e93d1037e9df2bc51979503d9cb45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfd90ba1bd197a4378afa7b4c5705ba16b7e93d1037e9df2bc51979503d9cb45","first_computed_at":"2026-05-18T03:18:28.373007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:28.373007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3h7Vyw631g0mmycPuK60mOdVVkVegQhkz2kvJcczC8z1YbGDEXkJkBZYoNf6/6EatusCaifz/LvvRhyRWBC7CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:28.373673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38651674ac3d8d6a2af83ceefb8db6fa74aab855ebef261a31040b0c05dff2ae","sha256:f7f8d0316c1f43f85c2f135476adec12499e86fef02f6f0b5ce1e161620ea78e"],"state_sha256":"0f91b5399a8252b9ee768c497fe6e8c0effcc6a0b6bf41ae388a6af3b8c18b83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5fJcwCr7FtPVEqnsvBaaIsh4vSEUM7jVWp251WE+uPfKSPZiJ8uqoojPww46jXVqC5RW8Z6jd8iAH/mIW6uBCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:24:07.495040Z","bundle_sha256":"0044eaa3f8228004d4759a7073ca986a0d61aa2eac00e31ba121e8749e7f95ef"}}