{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DJVEI5U2HAVPKOFNL2SVVZACTW","short_pith_number":"pith:DJVEI5U2","canonical_record":{"source":{"id":"1110.5045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T13:44:54Z","cross_cats_sorted":["cs.IT","math.GR","math.IT"],"title_canon_sha256":"92ae157dfe531ead1c63d8a9ddbe9e97ce07e39ff9670b6aa5c8e33a9b6f37ca","abstract_canon_sha256":"b84b59dc6ddaf1bf5e0b97fafd77201494aa65ad3512ee4f770cc2ea74d06683"},"schema_version":"1.0"},"canonical_sha256":"1a6a44769a382af538ad5ea55ae4029db4016896edd7ba44e190a6c4092618f1","source":{"kind":"arxiv","id":"1110.5045","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5045","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5045v1","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5045","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"DJVEI5U2HAVP","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DJVEI5U2HAVPKOFN","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DJVEI5U2","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DJVEI5U2HAVPKOFNL2SVVZACTW","target":"record","payload":{"canonical_record":{"source":{"id":"1110.5045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T13:44:54Z","cross_cats_sorted":["cs.IT","math.GR","math.IT"],"title_canon_sha256":"92ae157dfe531ead1c63d8a9ddbe9e97ce07e39ff9670b6aa5c8e33a9b6f37ca","abstract_canon_sha256":"b84b59dc6ddaf1bf5e0b97fafd77201494aa65ad3512ee4f770cc2ea74d06683"},"schema_version":"1.0"},"canonical_sha256":"1a6a44769a382af538ad5ea55ae4029db4016896edd7ba44e190a6c4092618f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:24.836555Z","signature_b64":"eOOg0s3jI4Du+Hl4r9M/nxXuH43ziWReh7gpFF2RJ+AYiPxtiTLzGnY9du6zVw+L5HA8Q30p12ByeoFfaRnpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a6a44769a382af538ad5ea55ae4029db4016896edd7ba44e190a6c4092618f1","last_reissued_at":"2026-05-18T04:10:24.836024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:24.836024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.5045","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-18T04:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vDICGUGeKSG3oa06morLa1UPyvELWk1GtqHFX+msQlfdeVHobI9ZTkoFALZ17lFggkPBIQowJb4vtxzT7QA7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T11:03:24.061665Z"},"content_sha256":"74cd8c5708a798ac5d4213902f49af4b34b6edc1e183d9e4841794ea6abf7270","schema_version":"1.0","event_id":"sha256:74cd8c5708a798ac5d4213902f49af4b34b6edc1e183d9e4841794ea6abf7270"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DJVEI5U2HAVPKOFNL2SVVZACTW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error Graphs and the Reconstruction of Elements in Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.GR","math.IT"],"primary_cat":"math.CO","authors_text":"Johannes Siemons, Vladimir Levenshtein","submitted_at":"2011-10-23T13:44:54Z","abstract_excerpt":"Packing and covering problems for metric spaces, and graphs in particular, are of essential interest in combinatorics and coding theory. They are formulated in terms of metric balls of vertices. We consider a new problem in graph theory which is also based on the consideration of metric balls of vertices, but which is distinct from the traditional packing and covering problems. This problem is motivated by applications in information transmission when redundancy of messages is not sufficient for their exact reconstruction, and applications in computational biology when one wishes to restore an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5045","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-18T04:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V1MY/AHMQiW8uMOWOK7kxkB4NCIiBJHavOpTkkHFn4vuiUJCVH26ap2LoKPze0lxAd9BDOyKIDf4zo555YxlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T11:03:24.062012Z"},"content_sha256":"141e4ec57b652ac2a3647609d1574a08afceab7cf8e1e6942fd41e33008f5723","schema_version":"1.0","event_id":"sha256:141e4ec57b652ac2a3647609d1574a08afceab7cf8e1e6942fd41e33008f5723"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJVEI5U2HAVPKOFNL2SVVZACTW/bundle.json","state_url":"https://pith.science/pith/DJVEI5U2HAVPKOFNL2SVVZACTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJVEI5U2HAVPKOFNL2SVVZACTW/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-27T11:03:24Z","links":{"resolver":"https://pith.science/pith/DJVEI5U2HAVPKOFNL2SVVZACTW","bundle":"https://pith.science/pith/DJVEI5U2HAVPKOFNL2SVVZACTW/bundle.json","state":"https://pith.science/pith/DJVEI5U2HAVPKOFNL2SVVZACTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJVEI5U2HAVPKOFNL2SVVZACTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DJVEI5U2HAVPKOFNL2SVVZACTW","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":"b84b59dc6ddaf1bf5e0b97fafd77201494aa65ad3512ee4f770cc2ea74d06683","cross_cats_sorted":["cs.IT","math.GR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T13:44:54Z","title_canon_sha256":"92ae157dfe531ead1c63d8a9ddbe9e97ce07e39ff9670b6aa5c8e33a9b6f37ca"},"schema_version":"1.0","source":{"id":"1110.5045","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5045","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5045v1","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5045","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"DJVEI5U2HAVP","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DJVEI5U2HAVPKOFN","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DJVEI5U2","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:141e4ec57b652ac2a3647609d1574a08afceab7cf8e1e6942fd41e33008f5723","target":"graph","created_at":"2026-05-18T04:10:24Z","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":"Packing and covering problems for metric spaces, and graphs in particular, are of essential interest in combinatorics and coding theory. They are formulated in terms of metric balls of vertices. We consider a new problem in graph theory which is also based on the consideration of metric balls of vertices, but which is distinct from the traditional packing and covering problems. This problem is motivated by applications in information transmission when redundancy of messages is not sufficient for their exact reconstruction, and applications in computational biology when one wishes to restore an","authors_text":"Johannes Siemons, Vladimir Levenshtein","cross_cats":["cs.IT","math.GR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T13:44:54Z","title":"Error Graphs and the Reconstruction of Elements in Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5045","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:74cd8c5708a798ac5d4213902f49af4b34b6edc1e183d9e4841794ea6abf7270","target":"record","created_at":"2026-05-18T04:10:24Z","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":"b84b59dc6ddaf1bf5e0b97fafd77201494aa65ad3512ee4f770cc2ea74d06683","cross_cats_sorted":["cs.IT","math.GR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T13:44:54Z","title_canon_sha256":"92ae157dfe531ead1c63d8a9ddbe9e97ce07e39ff9670b6aa5c8e33a9b6f37ca"},"schema_version":"1.0","source":{"id":"1110.5045","kind":"arxiv","version":1}},"canonical_sha256":"1a6a44769a382af538ad5ea55ae4029db4016896edd7ba44e190a6c4092618f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a6a44769a382af538ad5ea55ae4029db4016896edd7ba44e190a6c4092618f1","first_computed_at":"2026-05-18T04:10:24.836024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:24.836024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eOOg0s3jI4Du+Hl4r9M/nxXuH43ziWReh7gpFF2RJ+AYiPxtiTLzGnY9du6zVw+L5HA8Q30p12ByeoFfaRnpCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:24.836555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5045","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74cd8c5708a798ac5d4213902f49af4b34b6edc1e183d9e4841794ea6abf7270","sha256:141e4ec57b652ac2a3647609d1574a08afceab7cf8e1e6942fd41e33008f5723"],"state_sha256":"faf10a7b26032a9ee8ac3f9605a05d16d9990c2932b72e0cf08fbda91b5f9a58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhjud+rF2F+2JGDlO7xT/S2hQ8Tt0ziQefCr51JG05sC6nk4pnSi94dfOEPCF/0+7qpC3yPzrivivMP9m9E/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T11:03:24.063905Z","bundle_sha256":"dc5b856f3f9d01f749691ee16c3f30dd1fa61df32d5ec6c6bf68e27ffb559e2c"}}