{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EDMV3YEQPOHGX2LNGTXL2KNNOU","short_pith_number":"pith:EDMV3YEQ","canonical_record":{"source":{"id":"1601.04504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:30:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c013d799c7fdce3eec3d4e2f5d88a6f28695fdacf2f033c6e8945d645440bec3","abstract_canon_sha256":"089f4ddc52839c50ac5fde318f16b333943e91256c6316883d714ac86998486b"},"schema_version":"1.0"},"canonical_sha256":"20d95de0907b8e6be96d34eebd29ad750aa269ad08aba98a49c6285c2a075e08","source":{"kind":"arxiv","id":"1601.04504","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04504","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04504v2","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04504","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"EDMV3YEQPOHG","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EDMV3YEQPOHGX2LN","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EDMV3YEQ","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EDMV3YEQPOHGX2LNGTXL2KNNOU","target":"record","payload":{"canonical_record":{"source":{"id":"1601.04504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:30:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c013d799c7fdce3eec3d4e2f5d88a6f28695fdacf2f033c6e8945d645440bec3","abstract_canon_sha256":"089f4ddc52839c50ac5fde318f16b333943e91256c6316883d714ac86998486b"},"schema_version":"1.0"},"canonical_sha256":"20d95de0907b8e6be96d34eebd29ad750aa269ad08aba98a49c6285c2a075e08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:38.331325Z","signature_b64":"yEwufbK+YcH1kdgixE46V5L/Q0elbSnN5MiLVs8rJ+zbssvOjVQyOXv83KWr1lqT8H6nhmYtpqcoGp8DSlfyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20d95de0907b8e6be96d34eebd29ad750aa269ad08aba98a49c6285c2a075e08","last_reissued_at":"2026-05-18T01:15:38.330706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:38.330706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.04504","source_version":2,"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-18T01:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VB9mkriC72M5nqWIbfBH9RtyDbuABrhdNgd5QZ5AHzjmlLukQnp1ywTyhyOzdnX5GKZ/eBhA5xehDgVifx6YCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:10:42.041061Z"},"content_sha256":"caa228aa7d73f687f4239b200cde3c495b60357dc09bfce2430efeb5eb2c42ee","schema_version":"1.0","event_id":"sha256:caa228aa7d73f687f4239b200cde3c495b60357dc09bfce2430efeb5eb2c42ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EDMV3YEQPOHGX2LNGTXL2KNNOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding for Locality in Reconstructing Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Muriel Medard, Netanel Raviv","submitted_at":"2016-01-18T13:30:40Z","abstract_excerpt":"The problem of storing permutations in a distributed manner arises in several common scenarios, such as efficient updates of a large, encrypted, or compressed data set. This problem may be addressed in either a combinatorial or a coding approach. The former approach boils down to presenting large sets of permutations with \\textit{locality}, that is, any symbol of the permutation can be computed from a small set of other symbols. In the latter approach, a permutation may be coded in order to achieve locality. This paper focuses on the combinatorial approach.\n  We provide upper and lower bounds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04504","kind":"arxiv","version":2},"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-18T01:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vwn7vRVzlCb52AUaV1l/uoy5qdWfBO5OXRQvJP9/PNHbQlOBSPs/1j6SkqMbelPb4c8D419WqSXKeT7pveNNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:10:42.041532Z"},"content_sha256":"790a86cbdae69d3847b41a28ce9ee9e51759417f86824e543466d5a326b0be91","schema_version":"1.0","event_id":"sha256:790a86cbdae69d3847b41a28ce9ee9e51759417f86824e543466d5a326b0be91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDMV3YEQPOHGX2LNGTXL2KNNOU/bundle.json","state_url":"https://pith.science/pith/EDMV3YEQPOHGX2LNGTXL2KNNOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDMV3YEQPOHGX2LNGTXL2KNNOU/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-06-10T18:10:42Z","links":{"resolver":"https://pith.science/pith/EDMV3YEQPOHGX2LNGTXL2KNNOU","bundle":"https://pith.science/pith/EDMV3YEQPOHGX2LNGTXL2KNNOU/bundle.json","state":"https://pith.science/pith/EDMV3YEQPOHGX2LNGTXL2KNNOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDMV3YEQPOHGX2LNGTXL2KNNOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EDMV3YEQPOHGX2LNGTXL2KNNOU","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":"089f4ddc52839c50ac5fde318f16b333943e91256c6316883d714ac86998486b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:30:40Z","title_canon_sha256":"c013d799c7fdce3eec3d4e2f5d88a6f28695fdacf2f033c6e8945d645440bec3"},"schema_version":"1.0","source":{"id":"1601.04504","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04504","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04504v2","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04504","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"EDMV3YEQPOHG","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EDMV3YEQPOHGX2LN","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EDMV3YEQ","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:790a86cbdae69d3847b41a28ce9ee9e51759417f86824e543466d5a326b0be91","target":"graph","created_at":"2026-05-18T01:15:38Z","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 storing permutations in a distributed manner arises in several common scenarios, such as efficient updates of a large, encrypted, or compressed data set. This problem may be addressed in either a combinatorial or a coding approach. The former approach boils down to presenting large sets of permutations with \\textit{locality}, that is, any symbol of the permutation can be computed from a small set of other symbols. In the latter approach, a permutation may be coded in order to achieve locality. This paper focuses on the combinatorial approach.\n  We provide upper and lower bounds ","authors_text":"Eitan Yaakobi, Muriel Medard, Netanel Raviv","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:30:40Z","title":"Coding for Locality in Reconstructing Permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04504","kind":"arxiv","version":2},"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:caa228aa7d73f687f4239b200cde3c495b60357dc09bfce2430efeb5eb2c42ee","target":"record","created_at":"2026-05-18T01:15:38Z","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":"089f4ddc52839c50ac5fde318f16b333943e91256c6316883d714ac86998486b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:30:40Z","title_canon_sha256":"c013d799c7fdce3eec3d4e2f5d88a6f28695fdacf2f033c6e8945d645440bec3"},"schema_version":"1.0","source":{"id":"1601.04504","kind":"arxiv","version":2}},"canonical_sha256":"20d95de0907b8e6be96d34eebd29ad750aa269ad08aba98a49c6285c2a075e08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20d95de0907b8e6be96d34eebd29ad750aa269ad08aba98a49c6285c2a075e08","first_computed_at":"2026-05-18T01:15:38.330706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:38.330706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yEwufbK+YcH1kdgixE46V5L/Q0elbSnN5MiLVs8rJ+zbssvOjVQyOXv83KWr1lqT8H6nhmYtpqcoGp8DSlfyCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:38.331325Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04504","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:caa228aa7d73f687f4239b200cde3c495b60357dc09bfce2430efeb5eb2c42ee","sha256:790a86cbdae69d3847b41a28ce9ee9e51759417f86824e543466d5a326b0be91"],"state_sha256":"a834ed8520a540582fe48d8b5665e32c50abf73f8793cacc071fc9f13becf062"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fd64/LGNWw1JSMsHV0Kvhh7D/BB+/n5U2SjnnIitykmd/fKZ6WdAHFx74PJhYS5WY22lJDsSrmEg72rivtNnBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T18:10:42.043542Z","bundle_sha256":"5f9bca58a46ab0fa3bcb0fab9f0a2bd14d9017be260dac07967708bfc17d2dff"}}