{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:5NUWSYTWVPQC7SR4P24OH27HKA","short_pith_number":"pith:5NUWSYTW","canonical_record":{"source":{"id":"2306.07862","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-06-13T15:48:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f719a296eaabaf9868579785886b689e72e3c6bf8089abf2475e5c0701f082bb","abstract_canon_sha256":"b62d9a3a12c69ccdd9f246703bad471ac2fa9a78def1e096a2b667e295aef100"},"schema_version":"1.0"},"canonical_sha256":"eb69696276abe02fca3c7eb8e3ebe75004f644e1527fb2d352193971dbdb8d3c","source":{"kind":"arxiv","id":"2306.07862","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.07862","created_at":"2026-07-05T11:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"2306.07862v2","created_at":"2026-07-05T11:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07862","created_at":"2026-07-05T11:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"5NUWSYTWVPQC","created_at":"2026-07-05T11:00:34Z"},{"alias_kind":"pith_short_16","alias_value":"5NUWSYTWVPQC7SR4","created_at":"2026-07-05T11:00:34Z"},{"alias_kind":"pith_short_8","alias_value":"5NUWSYTW","created_at":"2026-07-05T11:00:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:5NUWSYTWVPQC7SR4P24OH27HKA","target":"record","payload":{"canonical_record":{"source":{"id":"2306.07862","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-06-13T15:48:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f719a296eaabaf9868579785886b689e72e3c6bf8089abf2475e5c0701f082bb","abstract_canon_sha256":"b62d9a3a12c69ccdd9f246703bad471ac2fa9a78def1e096a2b667e295aef100"},"schema_version":"1.0"},"canonical_sha256":"eb69696276abe02fca3c7eb8e3ebe75004f644e1527fb2d352193971dbdb8d3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:34.756536Z","signature_b64":"TBEKMqVn7xmLMRI5PDftbIToxUSNsbe5JTRzAKBfQu6kzyXxhjY/GkFh9cKxKwvumPfTQA8c7KKuPs1OiLWxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb69696276abe02fca3c7eb8e3ebe75004f644e1527fb2d352193971dbdb8d3c","last_reissued_at":"2026-07-05T11:00:34.755956Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:34.755956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.07862","source_version":2,"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-07-05T11:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DLwfIRg8E6xdvkieNCvwqGdCAZI+9pUDSdjXToqou40SnW1Nk7Rl8NMnQD/lOLcbsI9V7rJe5NofJMnJg2dfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:46:02.612638Z"},"content_sha256":"c9e2cfd54f33d43540195b39be568e779434775fe6df068ef7e756f078bbbbaf","schema_version":"1.0","event_id":"sha256:c9e2cfd54f33d43540195b39be568e779434775fe6df068ef7e756f078bbbbaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:5NUWSYTWVPQC7SR4P24OH27HKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Optimal Results on Codes for Location in Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Tero Laihonen, Tuomo Lehtil\\\"a, Ville Junnila","submitted_at":"2023-06-13T15:48:09Z","abstract_excerpt":"In this paper, we broaden the understanding of the recently introduced concepts of solid-locating-dominating and self-locating-dominating codes in various graphs. In particular, we present the optimal, i.e., smallest possible, codes in the infinite triangular and king grids. Furthermore, we give optimal locating-dominating, self-locating-dominating and solid-locating-dominating codes in the direct product $K_n\\times K_m$ of complete graphs. We also present optimal solid-locating-dominating codes for the Hamming graphs $K_q\\square K_q\\square K_q$ with $q\\geq2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07862","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.07862/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGaGYvHIxaYDbXGBLHDqPHXj/AEc0VC6T5viL5Nl1noP2tXd+tH1eomZngZ71/ZIDU65mUuSIy0KpDCZhkASCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:46:02.613213Z"},"content_sha256":"72c938864641e878251b671271d30e0ee6a1ba3cbe45de0c58a875116806380a","schema_version":"1.0","event_id":"sha256:72c938864641e878251b671271d30e0ee6a1ba3cbe45de0c58a875116806380a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NUWSYTWVPQC7SR4P24OH27HKA/bundle.json","state_url":"https://pith.science/pith/5NUWSYTWVPQC7SR4P24OH27HKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NUWSYTWVPQC7SR4P24OH27HKA/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-08-08T20:46:02Z","links":{"resolver":"https://pith.science/pith/5NUWSYTWVPQC7SR4P24OH27HKA","bundle":"https://pith.science/pith/5NUWSYTWVPQC7SR4P24OH27HKA/bundle.json","state":"https://pith.science/pith/5NUWSYTWVPQC7SR4P24OH27HKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NUWSYTWVPQC7SR4P24OH27HKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5NUWSYTWVPQC7SR4P24OH27HKA","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":"b62d9a3a12c69ccdd9f246703bad471ac2fa9a78def1e096a2b667e295aef100","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-06-13T15:48:09Z","title_canon_sha256":"f719a296eaabaf9868579785886b689e72e3c6bf8089abf2475e5c0701f082bb"},"schema_version":"1.0","source":{"id":"2306.07862","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.07862","created_at":"2026-07-05T11:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"2306.07862v2","created_at":"2026-07-05T11:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07862","created_at":"2026-07-05T11:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"5NUWSYTWVPQC","created_at":"2026-07-05T11:00:34Z"},{"alias_kind":"pith_short_16","alias_value":"5NUWSYTWVPQC7SR4","created_at":"2026-07-05T11:00:34Z"},{"alias_kind":"pith_short_8","alias_value":"5NUWSYTW","created_at":"2026-07-05T11:00:34Z"}],"graph_snapshots":[{"event_id":"sha256:72c938864641e878251b671271d30e0ee6a1ba3cbe45de0c58a875116806380a","target":"graph","created_at":"2026-07-05T11:00:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.07862/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we broaden the understanding of the recently introduced concepts of solid-locating-dominating and self-locating-dominating codes in various graphs. In particular, we present the optimal, i.e., smallest possible, codes in the infinite triangular and king grids. Furthermore, we give optimal locating-dominating, self-locating-dominating and solid-locating-dominating codes in the direct product $K_n\\times K_m$ of complete graphs. We also present optimal solid-locating-dominating codes for the Hamming graphs $K_q\\square K_q\\square K_q$ with $q\\geq2$.","authors_text":"Tero Laihonen, Tuomo Lehtil\\\"a, Ville Junnila","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-06-13T15:48:09Z","title":"New Optimal Results on Codes for Location in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07862","kind":"arxiv","version":2},"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:c9e2cfd54f33d43540195b39be568e779434775fe6df068ef7e756f078bbbbaf","target":"record","created_at":"2026-07-05T11:00:34Z","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":"b62d9a3a12c69ccdd9f246703bad471ac2fa9a78def1e096a2b667e295aef100","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-06-13T15:48:09Z","title_canon_sha256":"f719a296eaabaf9868579785886b689e72e3c6bf8089abf2475e5c0701f082bb"},"schema_version":"1.0","source":{"id":"2306.07862","kind":"arxiv","version":2}},"canonical_sha256":"eb69696276abe02fca3c7eb8e3ebe75004f644e1527fb2d352193971dbdb8d3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb69696276abe02fca3c7eb8e3ebe75004f644e1527fb2d352193971dbdb8d3c","first_computed_at":"2026-07-05T11:00:34.755956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:00:34.755956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TBEKMqVn7xmLMRI5PDftbIToxUSNsbe5JTRzAKBfQu6kzyXxhjY/GkFh9cKxKwvumPfTQA8c7KKuPs1OiLWxDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:00:34.756536Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.07862","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9e2cfd54f33d43540195b39be568e779434775fe6df068ef7e756f078bbbbaf","sha256:72c938864641e878251b671271d30e0ee6a1ba3cbe45de0c58a875116806380a"],"state_sha256":"d61c156405fab23ef18500ca40ebd585cce40746dcf47848bab78a3d9d5ac4c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vb2FuXdGuBMOCXwQtqHbukL7xbZYmu5kXHEkB5z3+frz7YeFyiEeQV/kUo64OYPLr4uN/SOLBs9pteT0SWkkBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:46:02.617099Z","bundle_sha256":"b4aac827c57c50ed4353d5f387f7b93d9b190d923968b0188b0736879a8df974"}}