{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PLWFJIAWYXIRRUU4CN2HWUO3G4","short_pith_number":"pith:PLWFJIAW","schema_version":"1.0","canonical_sha256":"7aec54a016c5d118d29c13747b51db371d22341588bae1ecbdb1ce08f9487a9c","source":{"kind":"arxiv","id":"1004.4063","version":2},"attestation_state":"computed","paper":{"title":"On two variations of identifying codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.DM","authors_text":"Aline Parreau (IF), Mickael Montassier (LaBRI), Olivier Delmas (LaBRI), Sylvain Gravier (IF)","submitted_at":"2010-04-23T07:51:31Z","abstract_excerpt":"Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and light codes. They correspond to fault-detection by successive rounds. We give exact bounds for those two definitions for the family of cycles."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1004.4063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-04-23T07:51:31Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"be9bfe9911bc0fdb9f8d147513bab070155b0950fbf1141ee5fae497a9280fde","abstract_canon_sha256":"115ec1829b16940919e1373ab6f23edf94db263c4e7e2dac9253a618fd719b4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:43.780517Z","signature_b64":"nJOpMIP4uFVFdObmldWeF4jS7hZ42a5sSXw619/1b1WHILlipEXAkjlRuOgl4U7LOUHm7FzuasKHh9AQ+hwICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aec54a016c5d118d29c13747b51db371d22341588bae1ecbdb1ce08f9487a9c","last_reissued_at":"2026-05-18T04:19:43.779951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:43.779951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On two variations of identifying codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.DM","authors_text":"Aline Parreau (IF), Mickael Montassier (LaBRI), Olivier Delmas (LaBRI), Sylvain Gravier (IF)","submitted_at":"2010-04-23T07:51:31Z","abstract_excerpt":"Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and light codes. They correspond to fault-detection by successive rounds. We give exact bounds for those two definitions for the family of cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4063","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1004.4063","created_at":"2026-05-18T04:19:43.780030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.4063v2","created_at":"2026-05-18T04:19:43.780030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4063","created_at":"2026-05-18T04:19:43.780030+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLWFJIAWYXIR","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLWFJIAWYXIRRUU4","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLWFJIAW","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PLWFJIAWYXIRRUU4CN2HWUO3G4","json":"https://pith.science/pith/PLWFJIAWYXIRRUU4CN2HWUO3G4.json","graph_json":"https://pith.science/api/pith-number/PLWFJIAWYXIRRUU4CN2HWUO3G4/graph.json","events_json":"https://pith.science/api/pith-number/PLWFJIAWYXIRRUU4CN2HWUO3G4/events.json","paper":"https://pith.science/paper/PLWFJIAW"},"agent_actions":{"view_html":"https://pith.science/pith/PLWFJIAWYXIRRUU4CN2HWUO3G4","download_json":"https://pith.science/pith/PLWFJIAWYXIRRUU4CN2HWUO3G4.json","view_paper":"https://pith.science/paper/PLWFJIAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.4063&json=true","fetch_graph":"https://pith.science/api/pith-number/PLWFJIAWYXIRRUU4CN2HWUO3G4/graph.json","fetch_events":"https://pith.science/api/pith-number/PLWFJIAWYXIRRUU4CN2HWUO3G4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLWFJIAWYXIRRUU4CN2HWUO3G4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLWFJIAWYXIRRUU4CN2HWUO3G4/action/storage_attestation","attest_author":"https://pith.science/pith/PLWFJIAWYXIRRUU4CN2HWUO3G4/action/author_attestation","sign_citation":"https://pith.science/pith/PLWFJIAWYXIRRUU4CN2HWUO3G4/action/citation_signature","submit_replication":"https://pith.science/pith/PLWFJIAWYXIRRUU4CN2HWUO3G4/action/replication_record"}},"created_at":"2026-05-18T04:19:43.780030+00:00","updated_at":"2026-05-18T04:19:43.780030+00:00"}