{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RICANZZJAFCOE3SBNZSVBM2TFB","short_pith_number":"pith:RICANZZJ","schema_version":"1.0","canonical_sha256":"8a0406e7290144e26e416e6550b353287adcbfbecdfab41cf6dec74602039d13","source":{"kind":"arxiv","id":"1810.03868","version":1},"attestation_state":"computed","paper":{"title":"On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Florian Barbero, Jocelyn Thiebaut, Lucas Isenmann","submitted_at":"2018-10-09T09:14:15Z","abstract_excerpt":"Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-problem may be of main interest. We introduce here a promising solution named Distance Identifying Set. The model contains Identifying Code (IC), Locating Dominating Set (LD) and their generalizations $r$-IC and $r$-LD where the closed neighborhood is considered up to distance $r$. It also contains Metric Dimension (MD) and its refinement $r$-MD in which the distance between two vertices is considered as infinite if t"},"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":"1810.03868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-09T09:14:15Z","cross_cats_sorted":[],"title_canon_sha256":"e2395e4c1c5ff9629a2ee42c34a13cea86ce4ae76cf1c22d731376f70aca6972","abstract_canon_sha256":"b4916e2d4362c9540b0f72db20546140ee96ea3e9d913fe40a21369443c52893"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:44.372400Z","signature_b64":"Kl+iQDe7B7VqmqbceGGTHjbwLPiiZh/cXumE6XBIEde1Y5BJoaH+LTaGEehbJX4z1cOtpL4ql70nBsoLbnvyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a0406e7290144e26e416e6550b353287adcbfbecdfab41cf6dec74602039d13","last_reissued_at":"2026-05-18T00:03:44.371938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:44.371938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Florian Barbero, Jocelyn Thiebaut, Lucas Isenmann","submitted_at":"2018-10-09T09:14:15Z","abstract_excerpt":"Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-problem may be of main interest. We introduce here a promising solution named Distance Identifying Set. The model contains Identifying Code (IC), Locating Dominating Set (LD) and their generalizations $r$-IC and $r$-LD where the closed neighborhood is considered up to distance $r$. It also contains Metric Dimension (MD) and its refinement $r$-MD in which the distance between two vertices is considered as infinite if t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03868","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.03868","created_at":"2026-05-18T00:03:44.372001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03868v1","created_at":"2026-05-18T00:03:44.372001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03868","created_at":"2026-05-18T00:03:44.372001+00:00"},{"alias_kind":"pith_short_12","alias_value":"RICANZZJAFCO","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RICANZZJAFCOE3SB","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RICANZZJ","created_at":"2026-05-18T12:32:50.500415+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/RICANZZJAFCOE3SBNZSVBM2TFB","json":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB.json","graph_json":"https://pith.science/api/pith-number/RICANZZJAFCOE3SBNZSVBM2TFB/graph.json","events_json":"https://pith.science/api/pith-number/RICANZZJAFCOE3SBNZSVBM2TFB/events.json","paper":"https://pith.science/paper/RICANZZJ"},"agent_actions":{"view_html":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB","download_json":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB.json","view_paper":"https://pith.science/paper/RICANZZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03868&json=true","fetch_graph":"https://pith.science/api/pith-number/RICANZZJAFCOE3SBNZSVBM2TFB/graph.json","fetch_events":"https://pith.science/api/pith-number/RICANZZJAFCOE3SBNZSVBM2TFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB/action/storage_attestation","attest_author":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB/action/author_attestation","sign_citation":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB/action/citation_signature","submit_replication":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB/action/replication_record"}},"created_at":"2026-05-18T00:03:44.372001+00:00","updated_at":"2026-05-18T00:03:44.372001+00:00"}