{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RICANZZJAFCOE3SBNZSVBM2TFB","short_pith_number":"pith:RICANZZJ","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"},"canonical_sha256":"8a0406e7290144e26e416e6550b353287adcbfbecdfab41cf6dec74602039d13","source":{"kind":"arxiv","id":"1810.03868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03868","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03868v1","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03868","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"RICANZZJAFCO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RICANZZJAFCOE3SB","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RICANZZJ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RICANZZJAFCOE3SBNZSVBM2TFB","target":"record","payload":{"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"},"canonical_sha256":"8a0406e7290144e26e416e6550b353287adcbfbecdfab41cf6dec74602039d13","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"},"source_kind":"arxiv","source_id":"1810.03868","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-18T00:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5OUOnMV5FgDT0ibS5kvcXiYVz7gzE0B5+z3cfc6KVPVH20FGRCGypzgxHRiFPen+DrMOHydOJsbve5vjFdNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:45:13.146718Z"},"content_sha256":"d18a63c4d9f0273c7da66cce36d8685113e6450557e5fae3263578c8c8baafcd","schema_version":"1.0","event_id":"sha256:d18a63c4d9f0273c7da66cce36d8685113e6450557e5fae3263578c8c8baafcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RICANZZJAFCOE3SBNZSVBM2TFB","target":"graph","payload":{"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"},"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-18T00:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJxfg2r3dFK3AixNiUUA0VW5mwTHe2prEtRA9uB1rQthCmBP6YCD2YZ761mhtuMXKuJCzPohZce0U9cYH1gsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:45:13.147065Z"},"content_sha256":"8d726d28869d27c2177d7e24b56470177edb734c9183cca22e90cf6870bd6a74","schema_version":"1.0","event_id":"sha256:8d726d28869d27c2177d7e24b56470177edb734c9183cca22e90cf6870bd6a74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB/bundle.json","state_url":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RICANZZJAFCOE3SBNZSVBM2TFB/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-28T14:45:13Z","links":{"resolver":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB","bundle":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB/bundle.json","state":"https://pith.science/pith/RICANZZJAFCOE3SBNZSVBM2TFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RICANZZJAFCOE3SBNZSVBM2TFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RICANZZJAFCOE3SBNZSVBM2TFB","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":"b4916e2d4362c9540b0f72db20546140ee96ea3e9d913fe40a21369443c52893","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-09T09:14:15Z","title_canon_sha256":"e2395e4c1c5ff9629a2ee42c34a13cea86ce4ae76cf1c22d731376f70aca6972"},"schema_version":"1.0","source":{"id":"1810.03868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03868","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03868v1","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03868","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"RICANZZJAFCO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RICANZZJAFCOE3SB","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RICANZZJ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:8d726d28869d27c2177d7e24b56470177edb734c9183cca22e90cf6870bd6a74","target":"graph","created_at":"2026-05-18T00:03:44Z","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":"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","authors_text":"Florian Barbero, Jocelyn Thiebaut, Lucas Isenmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-09T09:14:15Z","title":"On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03868","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:d18a63c4d9f0273c7da66cce36d8685113e6450557e5fae3263578c8c8baafcd","target":"record","created_at":"2026-05-18T00:03:44Z","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":"b4916e2d4362c9540b0f72db20546140ee96ea3e9d913fe40a21369443c52893","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-09T09:14:15Z","title_canon_sha256":"e2395e4c1c5ff9629a2ee42c34a13cea86ce4ae76cf1c22d731376f70aca6972"},"schema_version":"1.0","source":{"id":"1810.03868","kind":"arxiv","version":1}},"canonical_sha256":"8a0406e7290144e26e416e6550b353287adcbfbecdfab41cf6dec74602039d13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a0406e7290144e26e416e6550b353287adcbfbecdfab41cf6dec74602039d13","first_computed_at":"2026-05-18T00:03:44.371938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:44.371938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kl+iQDe7B7VqmqbceGGTHjbwLPiiZh/cXumE6XBIEde1Y5BJoaH+LTaGEehbJX4z1cOtpL4ql70nBsoLbnvyDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:44.372400Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d18a63c4d9f0273c7da66cce36d8685113e6450557e5fae3263578c8c8baafcd","sha256:8d726d28869d27c2177d7e24b56470177edb734c9183cca22e90cf6870bd6a74"],"state_sha256":"15553a2e40e8cea886772c6b15ba65a35606602a217f3c1533e313e594cbcb07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBY0XA0gSZJvUN10JnWE1GUcj068eBAnHaMt8Dg7qd8SIi8lQkU4n8WO48QUWreXzn1RANfO9JbkD7Ol+35ZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:45:13.148974Z","bundle_sha256":"a4500aa64c41d31e25a47bd416b75872184b4f40f8873ac516c262ba31bbc7fc"}}