{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B2N3VJAMAQEJCH2G2NPNRWDSQ7","short_pith_number":"pith:B2N3VJAM","schema_version":"1.0","canonical_sha256":"0e9bbaa40c0408911f46d35ed8d87287caf392cbe2291daafd144342a916fc85","source":{"kind":"arxiv","id":"1503.06479","version":1},"attestation_state":"computed","paper":{"title":"Multi-Version Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Majid Khabbazian","submitted_at":"2015-03-22T21:06:23Z","abstract_excerpt":"We derive a simple lower bound for the multi-version coding problem formulated in [1]. We also propose simple algorithms that almost match the lower bound derived. Another lower bound is proven for an extended version of the multi-version coding problem introduced in [2]."},"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":"1503.06479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-22T21:06:23Z","cross_cats_sorted":[],"title_canon_sha256":"53ebed86b721722d193f298fb7f9e3efc1b39a8a3523ef136cb53299597fd4d4","abstract_canon_sha256":"606d86c0f4aae442b69c89b45164b535230c9cd27f3699ade31c40dd6ff31e27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:38.268557Z","signature_b64":"LkBSl8ruCgTAzHFiT3+B2FuqjJ9jEMygzkx30M6vE790qNci26+gBaPoEhxtOku7y7/PnhVRTGmXJZNUZYEICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e9bbaa40c0408911f46d35ed8d87287caf392cbe2291daafd144342a916fc85","last_reissued_at":"2026-05-18T02:20:38.267914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:38.267914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Version Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Majid Khabbazian","submitted_at":"2015-03-22T21:06:23Z","abstract_excerpt":"We derive a simple lower bound for the multi-version coding problem formulated in [1]. We also propose simple algorithms that almost match the lower bound derived. Another lower bound is proven for an extended version of the multi-version coding problem introduced in [2]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06479","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":"1503.06479","created_at":"2026-05-18T02:20:38.268001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06479v1","created_at":"2026-05-18T02:20:38.268001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06479","created_at":"2026-05-18T02:20:38.268001+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2N3VJAMAQEJ","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2N3VJAMAQEJCH2G","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2N3VJAM","created_at":"2026-05-18T12:29:14.074870+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/B2N3VJAMAQEJCH2G2NPNRWDSQ7","json":"https://pith.science/pith/B2N3VJAMAQEJCH2G2NPNRWDSQ7.json","graph_json":"https://pith.science/api/pith-number/B2N3VJAMAQEJCH2G2NPNRWDSQ7/graph.json","events_json":"https://pith.science/api/pith-number/B2N3VJAMAQEJCH2G2NPNRWDSQ7/events.json","paper":"https://pith.science/paper/B2N3VJAM"},"agent_actions":{"view_html":"https://pith.science/pith/B2N3VJAMAQEJCH2G2NPNRWDSQ7","download_json":"https://pith.science/pith/B2N3VJAMAQEJCH2G2NPNRWDSQ7.json","view_paper":"https://pith.science/paper/B2N3VJAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06479&json=true","fetch_graph":"https://pith.science/api/pith-number/B2N3VJAMAQEJCH2G2NPNRWDSQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/B2N3VJAMAQEJCH2G2NPNRWDSQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2N3VJAMAQEJCH2G2NPNRWDSQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2N3VJAMAQEJCH2G2NPNRWDSQ7/action/storage_attestation","attest_author":"https://pith.science/pith/B2N3VJAMAQEJCH2G2NPNRWDSQ7/action/author_attestation","sign_citation":"https://pith.science/pith/B2N3VJAMAQEJCH2G2NPNRWDSQ7/action/citation_signature","submit_replication":"https://pith.science/pith/B2N3VJAMAQEJCH2G2NPNRWDSQ7/action/replication_record"}},"created_at":"2026-05-18T02:20:38.268001+00:00","updated_at":"2026-05-18T02:20:38.268001+00:00"}