{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XFTDB5SD6VJKDYZRPALXIZZCWP","short_pith_number":"pith:XFTDB5SD","canonical_record":{"source":{"id":"1401.2774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T10:37:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2dfbf60bd2403e2a513961a2a64fa66a7877b323690be21d7e0f265e824badfd","abstract_canon_sha256":"66b2be2943531f3e42df33dbf8031a103750b337a4467ee0631b124fd3f6f3fd"},"schema_version":"1.0"},"canonical_sha256":"b96630f643f552a1e3317817746722b3e1176a146f0db61c0808e18cd3d9f0a6","source":{"kind":"arxiv","id":"1401.2774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2774","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2774v1","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2774","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"pith_short_12","alias_value":"XFTDB5SD6VJK","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XFTDB5SD6VJKDYZR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XFTDB5SD","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XFTDB5SD6VJKDYZRPALXIZZCWP","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T10:37:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2dfbf60bd2403e2a513961a2a64fa66a7877b323690be21d7e0f265e824badfd","abstract_canon_sha256":"66b2be2943531f3e42df33dbf8031a103750b337a4467ee0631b124fd3f6f3fd"},"schema_version":"1.0"},"canonical_sha256":"b96630f643f552a1e3317817746722b3e1176a146f0db61c0808e18cd3d9f0a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:32.129651Z","signature_b64":"8VjVIFaULe0C7sLEq0A6jOMO/qU5qsamDj/T3oLHz5erXDd7157HlInbBwL/U8HJB4khHPSlMX10lAEzbtCvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b96630f643f552a1e3317817746722b3e1176a146f0db61c0808e18cd3d9f0a6","last_reissued_at":"2026-05-18T03:02:32.128931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:32.128931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2774","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:02:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dYcCvn75eaCSYs75Zw3p/L/PUUAchC0n3+uJxQ7fmm9Ewsc8ZaLML+mJu4dal0F8rFGlO94V0AAnSSuk4N7BAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:00:13.243971Z"},"content_sha256":"7a56475e358043126c263d5a9006119a342f69a621d704234652a8c2c37007a5","schema_version":"1.0","event_id":"sha256:7a56475e358043126c263d5a9006119a342f69a621d704234652a8c2c37007a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XFTDB5SD6VJKDYZRPALXIZZCWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Optimized-cost Repair in Multi-hop Distributed Storage Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Majid Gerami, Ming Xiao","submitted_at":"2014-01-13T10:37:55Z","abstract_excerpt":"The problem of exact repair of a failed node in multi-hop networked distributed storage systems is considered. Contrary to the most of the current studies which model the repair process by the direct links from surviving nodes to the new node, the repair is modeled by considering the multi-hop network structure, and taking into account that there might not exist direct links from all the surviving nodes to the new node. In the repair problem of these systems, surviving nodes may cooperate to transmit the repair traffic to the new node. In this setting, we define the total number of packets tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2774","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:02:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TIJy4FUFhr4xnKxVv5jau50WMhVhwnZJniRlujXzmyZApLclrO1B344dZPHMRRJyz3To6u7Ixc2c0fkZVqmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:00:13.244353Z"},"content_sha256":"82e0b954071b0e71b94a28fb91827f5c8cffa052e1eebcf1a65293f88f0f2a30","schema_version":"1.0","event_id":"sha256:82e0b954071b0e71b94a28fb91827f5c8cffa052e1eebcf1a65293f88f0f2a30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFTDB5SD6VJKDYZRPALXIZZCWP/bundle.json","state_url":"https://pith.science/pith/XFTDB5SD6VJKDYZRPALXIZZCWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFTDB5SD6VJKDYZRPALXIZZCWP/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-30T07:00:13Z","links":{"resolver":"https://pith.science/pith/XFTDB5SD6VJKDYZRPALXIZZCWP","bundle":"https://pith.science/pith/XFTDB5SD6VJKDYZRPALXIZZCWP/bundle.json","state":"https://pith.science/pith/XFTDB5SD6VJKDYZRPALXIZZCWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFTDB5SD6VJKDYZRPALXIZZCWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XFTDB5SD6VJKDYZRPALXIZZCWP","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":"66b2be2943531f3e42df33dbf8031a103750b337a4467ee0631b124fd3f6f3fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T10:37:55Z","title_canon_sha256":"2dfbf60bd2403e2a513961a2a64fa66a7877b323690be21d7e0f265e824badfd"},"schema_version":"1.0","source":{"id":"1401.2774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2774","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2774v1","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2774","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"pith_short_12","alias_value":"XFTDB5SD6VJK","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XFTDB5SD6VJKDYZR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XFTDB5SD","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:82e0b954071b0e71b94a28fb91827f5c8cffa052e1eebcf1a65293f88f0f2a30","target":"graph","created_at":"2026-05-18T03:02:32Z","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":"The problem of exact repair of a failed node in multi-hop networked distributed storage systems is considered. Contrary to the most of the current studies which model the repair process by the direct links from surviving nodes to the new node, the repair is modeled by considering the multi-hop network structure, and taking into account that there might not exist direct links from all the surviving nodes to the new node. In the repair problem of these systems, surviving nodes may cooperate to transmit the repair traffic to the new node. In this setting, we define the total number of packets tra","authors_text":"Majid Gerami, Ming Xiao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T10:37:55Z","title":"Exact Optimized-cost Repair in Multi-hop Distributed Storage Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2774","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:7a56475e358043126c263d5a9006119a342f69a621d704234652a8c2c37007a5","target":"record","created_at":"2026-05-18T03:02:32Z","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":"66b2be2943531f3e42df33dbf8031a103750b337a4467ee0631b124fd3f6f3fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T10:37:55Z","title_canon_sha256":"2dfbf60bd2403e2a513961a2a64fa66a7877b323690be21d7e0f265e824badfd"},"schema_version":"1.0","source":{"id":"1401.2774","kind":"arxiv","version":1}},"canonical_sha256":"b96630f643f552a1e3317817746722b3e1176a146f0db61c0808e18cd3d9f0a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b96630f643f552a1e3317817746722b3e1176a146f0db61c0808e18cd3d9f0a6","first_computed_at":"2026-05-18T03:02:32.128931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:32.128931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8VjVIFaULe0C7sLEq0A6jOMO/qU5qsamDj/T3oLHz5erXDd7157HlInbBwL/U8HJB4khHPSlMX10lAEzbtCvAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:32.129651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a56475e358043126c263d5a9006119a342f69a621d704234652a8c2c37007a5","sha256:82e0b954071b0e71b94a28fb91827f5c8cffa052e1eebcf1a65293f88f0f2a30"],"state_sha256":"82961b6f63f6a60c772dea25432d0a096e7ba1ab91ca381c7daeeac4cc99fdab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1Km3xIN1WLloRsMdlOFKTAMWTiI65QOYd0kzbJnyyxQ1aQLlbwp2QFdaUkGIK9GiL1+/pzrm8ifLb2QngJHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:00:13.246557Z","bundle_sha256":"01ca8bee102f07e26fe780cb58ad4ea7f20935a2e238068217a7dce81781f227"}}