{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NDQWXJZIDC3NP672DJYHZ66B6M","short_pith_number":"pith:NDQWXJZI","canonical_record":{"source":{"id":"1506.00392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-01T08:44:54Z","cross_cats_sorted":[],"title_canon_sha256":"dad2a58e8659d43ec3adbd896b6c46e4da01d3d2c778f13b88a5b9f011618f27","abstract_canon_sha256":"2db3cba36ef7973c53c08a4a0c619f3ddac78276a96a021e23c9d6d9687dc036"},"schema_version":"1.0"},"canonical_sha256":"68e16ba72818b6d7fbfa1a707cfbc1f329d1fa7f0adb42628faaec9f382bbfcc","source":{"kind":"arxiv","id":"1506.00392","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00392","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00392v1","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00392","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"pith_short_12","alias_value":"NDQWXJZIDC3N","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NDQWXJZIDC3NP672","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NDQWXJZI","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NDQWXJZIDC3NP672DJYHZ66B6M","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-01T08:44:54Z","cross_cats_sorted":[],"title_canon_sha256":"dad2a58e8659d43ec3adbd896b6c46e4da01d3d2c778f13b88a5b9f011618f27","abstract_canon_sha256":"2db3cba36ef7973c53c08a4a0c619f3ddac78276a96a021e23c9d6d9687dc036"},"schema_version":"1.0"},"canonical_sha256":"68e16ba72818b6d7fbfa1a707cfbc1f329d1fa7f0adb42628faaec9f382bbfcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:54.685473Z","signature_b64":"Q3DpbY+pvKZmxmitcQ2uGbDjLJuGOpkWA+oFzlfqlBXoUKQjiII9BJ5dL0uDAJKjD+fh28XenP4vIsDROGQRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e16ba72818b6d7fbfa1a707cfbc1f329d1fa7f0adb42628faaec9f382bbfcc","last_reissued_at":"2026-05-18T01:59:54.684979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:54.684979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00392","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-18T01:59:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjWkspe6JCL6NngnCndRA5B5u2u2taNAHm097XQm3WGTKU/wct0moxPrJXZDVae1+e9cA62hkhjuuIXK1whvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:48:53.730011Z"},"content_sha256":"1e20f888be4685caa395cc70fe5eea95bb191709ec7559ae742f810bfe670a5d","schema_version":"1.0","event_id":"sha256:1e20f888be4685caa395cc70fe5eea95bb191709ec7559ae742f810bfe670a5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NDQWXJZIDC3NP672DJYHZ66B6M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Further results on multiple coverings of the farthest-off points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander A. Davydov, Daniele Bartoli, Fernanda Pambianco, Massimo Giulietti, Stefano Marcugini","submitted_at":"2015-06-01T08:44:54Z","abstract_excerpt":"Multiple coverings of the farthest-off points ($(R,\\mu)$-MCF codes) and the corresponding $(\\rho,\\mu)$-saturating sets in projective spaces $PG(N,q)$ are considered. We propose and develop some methods which allow us to obtain new small $(1,\\mu)$-saturating sets and short $(2,\\mu)$-MCF codes with $\\mu$-density either equal to 1 (optimal saturating sets and almost perfect MCF-codes) or close to 1 (roughly $1+1/cq$, $c\\ge1$). In particular, we provide new algebraic constructions and some bounds. Also, we classify minimal and optimal $(1,\\mu)$-saturating sets in $PG(2,q)$, $q$ small."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00392","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-18T01:59:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L7Bn7twG7ZjB7vOeGI3yrRNzIZt4QPWWO63j1FZO6Ql7RFQRGTwHJF3vld/R+RVsJdUuEUuLNMgpLCJ4N5cDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:48:53.730731Z"},"content_sha256":"4b46910a23c996731e72daf8f9921d24d9d0e12bfa3d415cdfe66f78a71600ce","schema_version":"1.0","event_id":"sha256:4b46910a23c996731e72daf8f9921d24d9d0e12bfa3d415cdfe66f78a71600ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDQWXJZIDC3NP672DJYHZ66B6M/bundle.json","state_url":"https://pith.science/pith/NDQWXJZIDC3NP672DJYHZ66B6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDQWXJZIDC3NP672DJYHZ66B6M/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-06T08:48:53Z","links":{"resolver":"https://pith.science/pith/NDQWXJZIDC3NP672DJYHZ66B6M","bundle":"https://pith.science/pith/NDQWXJZIDC3NP672DJYHZ66B6M/bundle.json","state":"https://pith.science/pith/NDQWXJZIDC3NP672DJYHZ66B6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDQWXJZIDC3NP672DJYHZ66B6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NDQWXJZIDC3NP672DJYHZ66B6M","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":"2db3cba36ef7973c53c08a4a0c619f3ddac78276a96a021e23c9d6d9687dc036","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-01T08:44:54Z","title_canon_sha256":"dad2a58e8659d43ec3adbd896b6c46e4da01d3d2c778f13b88a5b9f011618f27"},"schema_version":"1.0","source":{"id":"1506.00392","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00392","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00392v1","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00392","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"pith_short_12","alias_value":"NDQWXJZIDC3N","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NDQWXJZIDC3NP672","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NDQWXJZI","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:4b46910a23c996731e72daf8f9921d24d9d0e12bfa3d415cdfe66f78a71600ce","target":"graph","created_at":"2026-05-18T01:59:54Z","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":"Multiple coverings of the farthest-off points ($(R,\\mu)$-MCF codes) and the corresponding $(\\rho,\\mu)$-saturating sets in projective spaces $PG(N,q)$ are considered. We propose and develop some methods which allow us to obtain new small $(1,\\mu)$-saturating sets and short $(2,\\mu)$-MCF codes with $\\mu$-density either equal to 1 (optimal saturating sets and almost perfect MCF-codes) or close to 1 (roughly $1+1/cq$, $c\\ge1$). In particular, we provide new algebraic constructions and some bounds. Also, we classify minimal and optimal $(1,\\mu)$-saturating sets in $PG(2,q)$, $q$ small.","authors_text":"Alexander A. Davydov, Daniele Bartoli, Fernanda Pambianco, Massimo Giulietti, Stefano Marcugini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-01T08:44:54Z","title":"Further results on multiple coverings of the farthest-off points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00392","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:1e20f888be4685caa395cc70fe5eea95bb191709ec7559ae742f810bfe670a5d","target":"record","created_at":"2026-05-18T01:59:54Z","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":"2db3cba36ef7973c53c08a4a0c619f3ddac78276a96a021e23c9d6d9687dc036","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-01T08:44:54Z","title_canon_sha256":"dad2a58e8659d43ec3adbd896b6c46e4da01d3d2c778f13b88a5b9f011618f27"},"schema_version":"1.0","source":{"id":"1506.00392","kind":"arxiv","version":1}},"canonical_sha256":"68e16ba72818b6d7fbfa1a707cfbc1f329d1fa7f0adb42628faaec9f382bbfcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68e16ba72818b6d7fbfa1a707cfbc1f329d1fa7f0adb42628faaec9f382bbfcc","first_computed_at":"2026-05-18T01:59:54.684979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:54.684979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q3DpbY+pvKZmxmitcQ2uGbDjLJuGOpkWA+oFzlfqlBXoUKQjiII9BJ5dL0uDAJKjD+fh28XenP4vIsDROGQRCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:54.685473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00392","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e20f888be4685caa395cc70fe5eea95bb191709ec7559ae742f810bfe670a5d","sha256:4b46910a23c996731e72daf8f9921d24d9d0e12bfa3d415cdfe66f78a71600ce"],"state_sha256":"7e6fa5391ed46f225146c895b6cace39f77e84415046ca5f8436dc8573a067fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rpmKShY6Cvbcyp0PAH5f3gN2KynWSrutXcIM5X8U5lLPLLumhnAtT2IKVRZvkcEu5g9LITNMw93G/l2C6qSrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:48:53.734524Z","bundle_sha256":"b31d6b86e7686eee958590022a1adb81406cd6d966ee5cf005833311508b39b6"}}