{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2FNHRBYQ6TM7ZJZQVGYCOD7UQ7","short_pith_number":"pith:2FNHRBYQ","canonical_record":{"source":{"id":"1109.1913","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-09T06:49:16Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"53b9d2cc3ce7f70f0c183cead4552898d5056fe55249293c965e92c31ed6cfca","abstract_canon_sha256":"6bb0d1bf03edc13e3a45582af0c2fa5a745a7c9dd347f2a68e4e4cf36dd78f8d"},"schema_version":"1.0"},"canonical_sha256":"d15a788710f4d9fca730a9b0270ff487d5b7349bdff3bd21163815693a520f7e","source":{"kind":"arxiv","id":"1109.1913","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1913","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1913v3","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1913","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"2FNHRBYQ6TM7","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2FNHRBYQ6TM7ZJZQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2FNHRBYQ","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2FNHRBYQ6TM7ZJZQVGYCOD7UQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1913","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-09T06:49:16Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"53b9d2cc3ce7f70f0c183cead4552898d5056fe55249293c965e92c31ed6cfca","abstract_canon_sha256":"6bb0d1bf03edc13e3a45582af0c2fa5a745a7c9dd347f2a68e4e4cf36dd78f8d"},"schema_version":"1.0"},"canonical_sha256":"d15a788710f4d9fca730a9b0270ff487d5b7349bdff3bd21163815693a520f7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:01.861539Z","signature_b64":"SqDezVImQTeWvQLRorroeGO+2woBDz0LHT1YOPQApltNJq5bcPcvkMHsQuuL0HakABZeqHETRsRGziC05p4FCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d15a788710f4d9fca730a9b0270ff487d5b7349bdff3bd21163815693a520f7e","last_reissued_at":"2026-05-18T04:01:01.860850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:01.860850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1913","source_version":3,"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:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+RX9rcUjenhbAawLPc0SWv9fmdOZNFwlSWo3Ij+zUOZV4jnYKOS+5tLBRHW6gZotx4A8A9wswD1+pgNq75dLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:13:01.113159Z"},"content_sha256":"eab3002d1b0df9aac9acca9fd47c1a26d6ca7002c3cf71f75428460915a1b97e","schema_version":"1.0","event_id":"sha256:eab3002d1b0df9aac9acca9fd47c1a26d6ca7002c3cf71f75428460915a1b97e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2FNHRBYQ6TM7ZJZQVGYCOD7UQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tolerant identification with Euclidean balls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Aline Parreau (IF), Tero Laihonen, Ville Junnila","submitted_at":"2011-09-09T06:49:16Z","abstract_excerpt":"The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. The identifying codes can be applied, for example, to sensor networks. In this paper, we consider as sensors the set Z^2 where one sensor can check its neighbours within Euclidean distance r. We construct tolerant identifying codes in this network that are robust against some changes in the neighbourhood monitored by each sensor. We give bounds for the smallest density of a tolerant identifying code for general values of r and Delta. We also provide infinite families of values (r,Delta) with optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1913","kind":"arxiv","version":3},"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:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2jAQmFYnedCxoXx2FzXCwtqRwFBCnaHCndkwudRfkmtQE3iQjVlgNU6e1v5awpPVnROkXNtFbyCpN31+eA/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:13:01.113906Z"},"content_sha256":"e0a4ae13bba62046f1c1d4ee298baf5cdca7510b1420005f1dd7402b53f11551","schema_version":"1.0","event_id":"sha256:e0a4ae13bba62046f1c1d4ee298baf5cdca7510b1420005f1dd7402b53f11551"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FNHRBYQ6TM7ZJZQVGYCOD7UQ7/bundle.json","state_url":"https://pith.science/pith/2FNHRBYQ6TM7ZJZQVGYCOD7UQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FNHRBYQ6TM7ZJZQVGYCOD7UQ7/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-27T21:13:01Z","links":{"resolver":"https://pith.science/pith/2FNHRBYQ6TM7ZJZQVGYCOD7UQ7","bundle":"https://pith.science/pith/2FNHRBYQ6TM7ZJZQVGYCOD7UQ7/bundle.json","state":"https://pith.science/pith/2FNHRBYQ6TM7ZJZQVGYCOD7UQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FNHRBYQ6TM7ZJZQVGYCOD7UQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2FNHRBYQ6TM7ZJZQVGYCOD7UQ7","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":"6bb0d1bf03edc13e3a45582af0c2fa5a745a7c9dd347f2a68e4e4cf36dd78f8d","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-09T06:49:16Z","title_canon_sha256":"53b9d2cc3ce7f70f0c183cead4552898d5056fe55249293c965e92c31ed6cfca"},"schema_version":"1.0","source":{"id":"1109.1913","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1913","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1913v3","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1913","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"2FNHRBYQ6TM7","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2FNHRBYQ6TM7ZJZQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2FNHRBYQ","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:e0a4ae13bba62046f1c1d4ee298baf5cdca7510b1420005f1dd7402b53f11551","target":"graph","created_at":"2026-05-18T04:01:01Z","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 concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. The identifying codes can be applied, for example, to sensor networks. In this paper, we consider as sensors the set Z^2 where one sensor can check its neighbours within Euclidean distance r. We construct tolerant identifying codes in this network that are robust against some changes in the neighbourhood monitored by each sensor. We give bounds for the smallest density of a tolerant identifying code for general values of r and Delta. We also provide infinite families of values (r,Delta) with optimal ","authors_text":"Aline Parreau (IF), Tero Laihonen, Ville Junnila","cross_cats":["cs.DM","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-09T06:49:16Z","title":"Tolerant identification with Euclidean balls"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1913","kind":"arxiv","version":3},"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:eab3002d1b0df9aac9acca9fd47c1a26d6ca7002c3cf71f75428460915a1b97e","target":"record","created_at":"2026-05-18T04:01:01Z","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":"6bb0d1bf03edc13e3a45582af0c2fa5a745a7c9dd347f2a68e4e4cf36dd78f8d","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-09T06:49:16Z","title_canon_sha256":"53b9d2cc3ce7f70f0c183cead4552898d5056fe55249293c965e92c31ed6cfca"},"schema_version":"1.0","source":{"id":"1109.1913","kind":"arxiv","version":3}},"canonical_sha256":"d15a788710f4d9fca730a9b0270ff487d5b7349bdff3bd21163815693a520f7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d15a788710f4d9fca730a9b0270ff487d5b7349bdff3bd21163815693a520f7e","first_computed_at":"2026-05-18T04:01:01.860850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:01.860850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SqDezVImQTeWvQLRorroeGO+2woBDz0LHT1YOPQApltNJq5bcPcvkMHsQuuL0HakABZeqHETRsRGziC05p4FCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:01.861539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1913","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eab3002d1b0df9aac9acca9fd47c1a26d6ca7002c3cf71f75428460915a1b97e","sha256:e0a4ae13bba62046f1c1d4ee298baf5cdca7510b1420005f1dd7402b53f11551"],"state_sha256":"ce31735de85b8860fd239f85b53a3257b4cd9a6e033a4f41de220960a5bf0746"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ffHQtNPTkpqB2v39Ckt7538qHPpHR2BF41dpo0g9/zHovhNvXdXl6e6LkdYOQZ3+7OAmfnWmucUblFh2ZVHpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:13:01.117890Z","bundle_sha256":"c6a396beeac47bdf441c3735e6a94e5d8bd91f7e1f3fa8d3b99789bb3c13b095"}}