{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DMSAT42DJCO2LRTMNIKRZF6W5H","short_pith_number":"pith:DMSAT42D","canonical_record":{"source":{"id":"1410.7287","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T16:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"eaa945e4697085aeb674208518c9e782720e40a7fe84324d699195c59e77cc7e","abstract_canon_sha256":"20b2941bb82acff97a2a54c9adae8eb64a537e759bb8cb6e0663cb3d594a20bf"},"schema_version":"1.0"},"canonical_sha256":"1b2409f343489da5c66c6a151c97d6e9e46683775cfa78a06acf6802fd0fd461","source":{"kind":"arxiv","id":"1410.7287","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7287","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7287v2","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7287","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"DMSAT42DJCO2","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DMSAT42DJCO2LRTM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DMSAT42D","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DMSAT42DJCO2LRTMNIKRZF6W5H","target":"record","payload":{"canonical_record":{"source":{"id":"1410.7287","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T16:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"eaa945e4697085aeb674208518c9e782720e40a7fe84324d699195c59e77cc7e","abstract_canon_sha256":"20b2941bb82acff97a2a54c9adae8eb64a537e759bb8cb6e0663cb3d594a20bf"},"schema_version":"1.0"},"canonical_sha256":"1b2409f343489da5c66c6a151c97d6e9e46683775cfa78a06acf6802fd0fd461","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:21.550832Z","signature_b64":"wta6l13LHwLC+Pt0D9vyHFQ3TE6RJgfqv2KyanFwXr1qx3BCymnmCV3twPbKbI3gO/8D+Oh/iiWRFVanyiTSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b2409f343489da5c66c6a151c97d6e9e46683775cfa78a06acf6802fd0fd461","last_reissued_at":"2026-05-18T01:29:21.550253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:21.550253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.7287","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-05-18T01:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"br7xcI4dRXZWdlgdp2okeepsJlAdZDfD/ysgIzqGf6LMcQpUAj8F/JhHp9yWjBI+y33Ucaq0PFcAU+A+1u5pAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:28:59.704328Z"},"content_sha256":"b5354337622c34f490d0959c85c9fae36a129591644e374f3f0f6bebe82bf868","schema_version":"1.0","event_id":"sha256:b5354337622c34f490d0959c85c9fae36a129591644e374f3f0f6bebe82bf868"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DMSAT42DJCO2LRTMNIKRZF6W5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The $k$-metric dimension of the lexicographic product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Estrada-Moreno, I. G. Yero, J. A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2014-10-27T16:05:26Z","abstract_excerpt":"Given a simple and connected graph $G=(V,E)$, and a positive integer $k$, a set $S\\subseteq V$ is said to be a $k$-metric generator for $G$, if for any pair of different vertices $u,v\\in V$, there exist at least $k$ vertices $w_1,w_2,\\ldots,w_k\\in S$ such that $d_G(u,w_i)\\ne d_G(v,w_i)$, for every $i\\in \\{1,\\ldots,k\\}$, where $d_G(x,y)$ denotes the distance between $x$ and $y$. The minimum cardinality of a $k$-metric generator is the $k$-metric dimension of $G$. A set $S\\subseteq V$ is a $k$-adjacency generator for $G$ if any two different vertices $x,y\\in V(G)$ satisfy $|((N_G(x)\\triangledown"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7287","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"},"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-18T01:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VEdL7ZmITERxNAXMbc3vum51BwrpOxKFUv4mRoBL/1Y7bZb+WvtAGF/0zz4ZoCE2jDEP0j3GeGqCssWOpyRuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:28:59.705024Z"},"content_sha256":"cb4eef11b6e3e9c1a5c9762a99b1230233089721013106fe9e468e0b2e4858ea","schema_version":"1.0","event_id":"sha256:cb4eef11b6e3e9c1a5c9762a99b1230233089721013106fe9e468e0b2e4858ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H/bundle.json","state_url":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMSAT42DJCO2LRTMNIKRZF6W5H/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-06-02T20:28:59Z","links":{"resolver":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H","bundle":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H/bundle.json","state":"https://pith.science/pith/DMSAT42DJCO2LRTMNIKRZF6W5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMSAT42DJCO2LRTMNIKRZF6W5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DMSAT42DJCO2LRTMNIKRZF6W5H","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":"20b2941bb82acff97a2a54c9adae8eb64a537e759bb8cb6e0663cb3d594a20bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T16:05:26Z","title_canon_sha256":"eaa945e4697085aeb674208518c9e782720e40a7fe84324d699195c59e77cc7e"},"schema_version":"1.0","source":{"id":"1410.7287","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7287","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7287v2","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7287","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"DMSAT42DJCO2","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DMSAT42DJCO2LRTM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DMSAT42D","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:cb4eef11b6e3e9c1a5c9762a99b1230233089721013106fe9e468e0b2e4858ea","target":"graph","created_at":"2026-05-18T01:29:21Z","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":"Given a simple and connected graph $G=(V,E)$, and a positive integer $k$, a set $S\\subseteq V$ is said to be a $k$-metric generator for $G$, if for any pair of different vertices $u,v\\in V$, there exist at least $k$ vertices $w_1,w_2,\\ldots,w_k\\in S$ such that $d_G(u,w_i)\\ne d_G(v,w_i)$, for every $i\\in \\{1,\\ldots,k\\}$, where $d_G(x,y)$ denotes the distance between $x$ and $y$. The minimum cardinality of a $k$-metric generator is the $k$-metric dimension of $G$. A set $S\\subseteq V$ is a $k$-adjacency generator for $G$ if any two different vertices $x,y\\in V(G)$ satisfy $|((N_G(x)\\triangledown","authors_text":"A. Estrada-Moreno, I. G. Yero, J. A. Rodr\\'iguez-Vel\\'azquez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T16:05:26Z","title":"The $k$-metric dimension of the lexicographic product of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7287","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:b5354337622c34f490d0959c85c9fae36a129591644e374f3f0f6bebe82bf868","target":"record","created_at":"2026-05-18T01:29:21Z","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":"20b2941bb82acff97a2a54c9adae8eb64a537e759bb8cb6e0663cb3d594a20bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T16:05:26Z","title_canon_sha256":"eaa945e4697085aeb674208518c9e782720e40a7fe84324d699195c59e77cc7e"},"schema_version":"1.0","source":{"id":"1410.7287","kind":"arxiv","version":2}},"canonical_sha256":"1b2409f343489da5c66c6a151c97d6e9e46683775cfa78a06acf6802fd0fd461","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b2409f343489da5c66c6a151c97d6e9e46683775cfa78a06acf6802fd0fd461","first_computed_at":"2026-05-18T01:29:21.550253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:21.550253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wta6l13LHwLC+Pt0D9vyHFQ3TE6RJgfqv2KyanFwXr1qx3BCymnmCV3twPbKbI3gO/8D+Oh/iiWRFVanyiTSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:21.550832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7287","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5354337622c34f490d0959c85c9fae36a129591644e374f3f0f6bebe82bf868","sha256:cb4eef11b6e3e9c1a5c9762a99b1230233089721013106fe9e468e0b2e4858ea"],"state_sha256":"cc52c604ef66e6d5df32376bcea0ad52ac78fa82dedb1aac99400185bcc40891"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64X4RalSJwSeckitHsNhdjrLACDxnQBxaHOBRXx6Ql5Buv+4bZz7mksoN9aOOPey2w+cNYVAd7Zs+7s1/wzWBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:28:59.708002Z","bundle_sha256":"7e8d73a2208896035f63dda971f232f999ace2b2d171e069dd91eb8f72f26f0c"}}