{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I4AFZG66NOBKOLUQFKP6II3WYJ","short_pith_number":"pith:I4AFZG66","canonical_record":{"source":{"id":"1411.2746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-11T09:58:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eec8d1b462963936f5e1f08ceb55fed284a389fa325e1c02be33c4bb779ae148","abstract_canon_sha256":"b362e5f533acc482bdfbde3b28b8002c67b3e51e61c928b5ff8a8814f099a169"},"schema_version":"1.0"},"canonical_sha256":"47005c9bde6b82a72e902a9fe42376c27f140e4321a0590f3a9cb14cb10f3bff","source":{"kind":"arxiv","id":"1411.2746","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2746","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2746v1","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2746","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"I4AFZG66NOBK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I4AFZG66NOBKOLUQ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I4AFZG66","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I4AFZG66NOBKOLUQFKP6II3WYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1411.2746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-11T09:58:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eec8d1b462963936f5e1f08ceb55fed284a389fa325e1c02be33c4bb779ae148","abstract_canon_sha256":"b362e5f533acc482bdfbde3b28b8002c67b3e51e61c928b5ff8a8814f099a169"},"schema_version":"1.0"},"canonical_sha256":"47005c9bde6b82a72e902a9fe42376c27f140e4321a0590f3a9cb14cb10f3bff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:53.169678Z","signature_b64":"HdFD8tB5tqNGWx9jkdhUPebISOb2AVlw9JJo5ya1zbMu1TeoMvmsowX/sHmlNR6xI1+suGSIP2p0cr6gPbMeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47005c9bde6b82a72e902a9fe42376c27f140e4321a0590f3a9cb14cb10f3bff","last_reissued_at":"2026-05-18T02:37:53.169102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:53.169102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.2746","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-18T02:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6hPg6VWFSXjQagzPt/VEXdwQnUWhvgjMHeEF004A6qhwUcCwdvDLrs2KWtfopYvZ8XrIG9EFSZHuOxgBbXnVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T23:28:14.881164Z"},"content_sha256":"a6e424eee7a101028b566a1d350dfeae5875598cff011c962879863440b38990","schema_version":"1.0","event_id":"sha256:a6e424eee7a101028b566a1d350dfeae5875598cff011c962879863440b38990"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I4AFZG66NOBKOLUQFKP6II3WYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Storage Allocations for Neighborhood-based Data Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aleksandar Minja, Dejan Vukobratovic, Dragana Bajovic, Dusan Jakovetic","submitted_at":"2014-11-11T09:58:09Z","abstract_excerpt":"We introduce a neighborhood-based data access model for distributed coded storage allocation. Storage nodes are connected in a generic network and data is accessed locally: a user accesses a randomly chosen storage node, which subsequently queries its neighborhood to recover the data object. We aim at finding an optimal allocation that minimizes the overall storage budget while ensuring recovery with probability one. We show that the problem reduces to finding the fractional dominating set of the underlying network. Furthermore, we develop a fully distributed algorithm where each storage node "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2746","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-18T02:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/4r7V4ZOdeKbb2YL/NKlG8oUJz23t2YWGbZAzPAjxzUD3BZeD93FX3QgZsNiv42bzJHn107XlXr/62uxf8LMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T23:28:14.881836Z"},"content_sha256":"16d05024e1fbf9a7cb51831cd795f5c757fa0701e528a70d67dba2127008e1cb","schema_version":"1.0","event_id":"sha256:16d05024e1fbf9a7cb51831cd795f5c757fa0701e528a70d67dba2127008e1cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4AFZG66NOBKOLUQFKP6II3WYJ/bundle.json","state_url":"https://pith.science/pith/I4AFZG66NOBKOLUQFKP6II3WYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4AFZG66NOBKOLUQFKP6II3WYJ/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-19T23:28:14Z","links":{"resolver":"https://pith.science/pith/I4AFZG66NOBKOLUQFKP6II3WYJ","bundle":"https://pith.science/pith/I4AFZG66NOBKOLUQFKP6II3WYJ/bundle.json","state":"https://pith.science/pith/I4AFZG66NOBKOLUQFKP6II3WYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4AFZG66NOBKOLUQFKP6II3WYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I4AFZG66NOBKOLUQFKP6II3WYJ","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":"b362e5f533acc482bdfbde3b28b8002c67b3e51e61c928b5ff8a8814f099a169","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-11T09:58:09Z","title_canon_sha256":"eec8d1b462963936f5e1f08ceb55fed284a389fa325e1c02be33c4bb779ae148"},"schema_version":"1.0","source":{"id":"1411.2746","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2746","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2746v1","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2746","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"I4AFZG66NOBK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I4AFZG66NOBKOLUQ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I4AFZG66","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:16d05024e1fbf9a7cb51831cd795f5c757fa0701e528a70d67dba2127008e1cb","target":"graph","created_at":"2026-05-18T02:37:53Z","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 introduce a neighborhood-based data access model for distributed coded storage allocation. Storage nodes are connected in a generic network and data is accessed locally: a user accesses a randomly chosen storage node, which subsequently queries its neighborhood to recover the data object. We aim at finding an optimal allocation that minimizes the overall storage budget while ensuring recovery with probability one. We show that the problem reduces to finding the fractional dominating set of the underlying network. Furthermore, we develop a fully distributed algorithm where each storage node ","authors_text":"Aleksandar Minja, Dejan Vukobratovic, Dragana Bajovic, Dusan Jakovetic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-11T09:58:09Z","title":"Distributed Storage Allocations for Neighborhood-based Data Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2746","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:a6e424eee7a101028b566a1d350dfeae5875598cff011c962879863440b38990","target":"record","created_at":"2026-05-18T02:37:53Z","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":"b362e5f533acc482bdfbde3b28b8002c67b3e51e61c928b5ff8a8814f099a169","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-11T09:58:09Z","title_canon_sha256":"eec8d1b462963936f5e1f08ceb55fed284a389fa325e1c02be33c4bb779ae148"},"schema_version":"1.0","source":{"id":"1411.2746","kind":"arxiv","version":1}},"canonical_sha256":"47005c9bde6b82a72e902a9fe42376c27f140e4321a0590f3a9cb14cb10f3bff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47005c9bde6b82a72e902a9fe42376c27f140e4321a0590f3a9cb14cb10f3bff","first_computed_at":"2026-05-18T02:37:53.169102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:53.169102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HdFD8tB5tqNGWx9jkdhUPebISOb2AVlw9JJo5ya1zbMu1TeoMvmsowX/sHmlNR6xI1+suGSIP2p0cr6gPbMeBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:53.169678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2746","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6e424eee7a101028b566a1d350dfeae5875598cff011c962879863440b38990","sha256:16d05024e1fbf9a7cb51831cd795f5c757fa0701e528a70d67dba2127008e1cb"],"state_sha256":"9b252b67a669c5a15a11fb1974f764ee594b7484482a142aeecb00a79f963497"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pi4+aTxWq4LRAmmi4XWqMlEPtb+o+zJIz43gvmqr/3tpe1T/NBMDL8BcwkqaqRiz2BSmeZV491KLZcmeEjGkCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T23:28:14.885463Z","bundle_sha256":"f5d05a74adefa9e8a5ee4afd5ab976389f8ff34822e05f52188b23430729a50e"}}