{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IYE3DNYNPH2CND42V6TZPXHBOG","short_pith_number":"pith:IYE3DNYN","canonical_record":{"source":{"id":"1408.2154","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-09T21:08:48Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"c5aec868f260896328919ea80fcf9fd6c6bccf08b0730cf9d291748248c437af","abstract_canon_sha256":"3705c6189e641e265622d91cb49bd4410d4902ed84c31cdb2fda042a8e4082ab"},"schema_version":"1.0"},"canonical_sha256":"4609b1b70d79f4268f9aafa797dce171860a48a0b05861d542ef792e8e79ab9e","source":{"kind":"arxiv","id":"1408.2154","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2154","created_at":"2026-05-18T02:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2154v2","created_at":"2026-05-18T02:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2154","created_at":"2026-05-18T02:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"IYE3DNYNPH2C","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IYE3DNYNPH2CND42","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IYE3DNYN","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IYE3DNYNPH2CND42V6TZPXHBOG","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2154","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-09T21:08:48Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"c5aec868f260896328919ea80fcf9fd6c6bccf08b0730cf9d291748248c437af","abstract_canon_sha256":"3705c6189e641e265622d91cb49bd4410d4902ed84c31cdb2fda042a8e4082ab"},"schema_version":"1.0"},"canonical_sha256":"4609b1b70d79f4268f9aafa797dce171860a48a0b05861d542ef792e8e79ab9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:40.042929Z","signature_b64":"uDzyc6oF8/OCsqBE4wE9rQulmRvD4Ij1T7bFY9ZdElvUR2Tvm6HGxZ8kUw/dR2wIiE1ppV4BXPcVfTkwcHY+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4609b1b70d79f4268f9aafa797dce171860a48a0b05861d542ef792e8e79ab9e","last_reissued_at":"2026-05-18T02:20:40.042329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:40.042329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2154","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-18T02:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uCmL40XAU6dI2J//T2s55AmlF8RHPhjzHapToSkbG/OlA53wFsnnQHGbtbeD7QC/OuEl5x/kgy/nq6bC7JdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:52:05.409428Z"},"content_sha256":"7bf0cfed5d24e048811ebedca62d0afe71757354524d4e7682668b57fbeb05fc","schema_version":"1.0","event_id":"sha256:7bf0cfed5d24e048811ebedca62d0afe71757354524d4e7682668b57fbeb05fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IYE3DNYNPH2CND42V6TZPXHBOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"k-Metric Antidimension: a Privacy Measure for Social Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Rolando Trujillo-Rasua","submitted_at":"2014-08-09T21:08:48Z","abstract_excerpt":"Let $G = (V, E)$ be a simple connected graph and $S = \\{w_1, \\cdots, w_t\\} \\subseteq V$ an ordered subset of vertices. The metric representation of a vertex $u\\in V$ with respect to $S$ is the $t$-vector $r(u|S) = (d_G(u, w_1), \\cdots, d_G(u, w_t))$, where $d_G(u, v)$ represents the length of a shortest $u-v$ path in $G$. The set $S$ is called a resolving set for $G$ if $r(u|S) = r(v|S)$ implies $u = v$ for every $u, v \\in V$. The smallest cardinality of a resolving set is the metric dimension of $G$. In this article we propose, to the best of our knowledge, a new problem in Graph Theory that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2154","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-18T02:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AA0+ETUf2+68J33cPNtotkI4WuAHW7Fuk1/mepc1aXyhs7N5qK9qJi1htfbfHYh92oFMdKApfKyhrwU0pkCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:52:05.409784Z"},"content_sha256":"2492a27ec1e7f2fc012a1ffbd86c93e89a993faeee6df88638f287a9fd6286c8","schema_version":"1.0","event_id":"sha256:2492a27ec1e7f2fc012a1ffbd86c93e89a993faeee6df88638f287a9fd6286c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG/bundle.json","state_url":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYE3DNYNPH2CND42V6TZPXHBOG/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-23T04:52:05Z","links":{"resolver":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG","bundle":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG/bundle.json","state":"https://pith.science/pith/IYE3DNYNPH2CND42V6TZPXHBOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYE3DNYNPH2CND42V6TZPXHBOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IYE3DNYNPH2CND42V6TZPXHBOG","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":"3705c6189e641e265622d91cb49bd4410d4902ed84c31cdb2fda042a8e4082ab","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-09T21:08:48Z","title_canon_sha256":"c5aec868f260896328919ea80fcf9fd6c6bccf08b0730cf9d291748248c437af"},"schema_version":"1.0","source":{"id":"1408.2154","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2154","created_at":"2026-05-18T02:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2154v2","created_at":"2026-05-18T02:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2154","created_at":"2026-05-18T02:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"IYE3DNYNPH2C","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IYE3DNYNPH2CND42","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IYE3DNYN","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:2492a27ec1e7f2fc012a1ffbd86c93e89a993faeee6df88638f287a9fd6286c8","target":"graph","created_at":"2026-05-18T02:20:40Z","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":"Let $G = (V, E)$ be a simple connected graph and $S = \\{w_1, \\cdots, w_t\\} \\subseteq V$ an ordered subset of vertices. The metric representation of a vertex $u\\in V$ with respect to $S$ is the $t$-vector $r(u|S) = (d_G(u, w_1), \\cdots, d_G(u, w_t))$, where $d_G(u, v)$ represents the length of a shortest $u-v$ path in $G$. The set $S$ is called a resolving set for $G$ if $r(u|S) = r(v|S)$ implies $u = v$ for every $u, v \\in V$. The smallest cardinality of a resolving set is the metric dimension of $G$. In this article we propose, to the best of our knowledge, a new problem in Graph Theory that ","authors_text":"Ismael G. Yero, Rolando Trujillo-Rasua","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-09T21:08:48Z","title":"k-Metric Antidimension: a Privacy Measure for Social Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2154","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:7bf0cfed5d24e048811ebedca62d0afe71757354524d4e7682668b57fbeb05fc","target":"record","created_at":"2026-05-18T02:20:40Z","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":"3705c6189e641e265622d91cb49bd4410d4902ed84c31cdb2fda042a8e4082ab","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-09T21:08:48Z","title_canon_sha256":"c5aec868f260896328919ea80fcf9fd6c6bccf08b0730cf9d291748248c437af"},"schema_version":"1.0","source":{"id":"1408.2154","kind":"arxiv","version":2}},"canonical_sha256":"4609b1b70d79f4268f9aafa797dce171860a48a0b05861d542ef792e8e79ab9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4609b1b70d79f4268f9aafa797dce171860a48a0b05861d542ef792e8e79ab9e","first_computed_at":"2026-05-18T02:20:40.042329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:40.042329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uDzyc6oF8/OCsqBE4wE9rQulmRvD4Ij1T7bFY9ZdElvUR2Tvm6HGxZ8kUw/dR2wIiE1ppV4BXPcVfTkwcHY+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:40.042929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2154","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bf0cfed5d24e048811ebedca62d0afe71757354524d4e7682668b57fbeb05fc","sha256:2492a27ec1e7f2fc012a1ffbd86c93e89a993faeee6df88638f287a9fd6286c8"],"state_sha256":"c5132fdf33a7bceeee620a1ea5e1a962f75da48692f6926ec00064fc3d11812f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Zdunj0LqQAcReGqyeDCPWu4LQlk873mA12sq4H1p0+0/8IDRKGp5Ou3XfZJE0sauu5y03pRFiUDUCxxrHrbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:52:05.411736Z","bundle_sha256":"d98d6b73990b3ba4bc046b65c825be40b2e871c5a140ebe8ba3b38b48289edd8"}}