{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:37MQXIN5DF5EG6FPU62MK4C3UF","short_pith_number":"pith:37MQXIN5","schema_version":"1.0","canonical_sha256":"dfd90ba1bd197a4378afa7b4c5705ba16b7e93d1037e9df2bc51979503d9cb45","source":{"kind":"arxiv","id":"1307.3621","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.3621","created_at":"2026-05-18T03:18:28.373092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3621v1","created_at":"2026-05-18T03:18:28.373092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3621","created_at":"2026-05-18T03:18:28.373092+00:00"},{"alias_kind":"pith_short_12","alias_value":"37MQXIN5DF5E","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"37MQXIN5DF5EG6FP","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"37MQXIN5","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF","json":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF.json","graph_json":"https://pith.science/api/pith-number/37MQXIN5DF5EG6FPU62MK4C3UF/graph.json","events_json":"https://pith.science/api/pith-number/37MQXIN5DF5EG6FPU62MK4C3UF/events.json","paper":"https://pith.science/paper/37MQXIN5"},"agent_actions":{"view_html":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF","download_json":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF.json","view_paper":"https://pith.science/paper/37MQXIN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3621&json=true","fetch_graph":"https://pith.science/api/pith-number/37MQXIN5DF5EG6FPU62MK4C3UF/graph.json","fetch_events":"https://pith.science/api/pith-number/37MQXIN5DF5EG6FPU62MK4C3UF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF/action/storage_attestation","attest_author":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF/action/author_attestation","sign_citation":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF/action/citation_signature","submit_replication":"https://pith.science/pith/37MQXIN5DF5EG6FPU62MK4C3UF/action/replication_record"}},"created_at":"2026-05-18T03:18:28.373092+00:00","updated_at":"2026-05-18T03:18:28.373092+00:00"}