{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O7Z6QKUY52524Z7IL7ZOFKTRUF","short_pith_number":"pith:O7Z6QKUY","canonical_record":{"source":{"id":"1811.05973","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-14T05:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"40b74355dfe3b2eef387837403d2961d041466528f3fea44db11a9d3eaca328d","abstract_canon_sha256":"258b6073d4b33b5b86878c93dbbb4ae18e7dbd8e7fc980b1d94cda94e942ebde"},"schema_version":"1.0"},"canonical_sha256":"77f3e82a98eebbae67e85ff2e2aa71a14772769d65f2cad647b15d4e4753de37","source":{"kind":"arxiv","id":"1811.05973","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05973","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05973v1","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05973","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"O7Z6QKUY5252","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O7Z6QKUY52524Z7I","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O7Z6QKUY","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O7Z6QKUY52524Z7IL7ZOFKTRUF","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05973","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-14T05:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"40b74355dfe3b2eef387837403d2961d041466528f3fea44db11a9d3eaca328d","abstract_canon_sha256":"258b6073d4b33b5b86878c93dbbb4ae18e7dbd8e7fc980b1d94cda94e942ebde"},"schema_version":"1.0"},"canonical_sha256":"77f3e82a98eebbae67e85ff2e2aa71a14772769d65f2cad647b15d4e4753de37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:38.914779Z","signature_b64":"qUgAnyBakCiDzqdPT4+HZSFJ5eoaKAFHmnUZOQX21xQcQCg/zVuHCPoJi8MQZQJGyMIvit4dM7nf8+tjWn0cCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77f3e82a98eebbae67e85ff2e2aa71a14772769d65f2cad647b15d4e4753de37","last_reissued_at":"2026-05-18T00:00:38.914342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:38.914342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05973","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:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5o4Kx8qT46gEx8jAMLrSnnJ1Yt1X2ZXpoENOVaeIIhpTg6Qs2OCL9i8WgzckOSGsA5OxyvhSP+nQKQA7OzZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:11:30.895022Z"},"content_sha256":"ef59360bc24b8842f7b6b7d0ff5c0d08d33d8d06490aed926240fe37f54b8d13","schema_version":"1.0","event_id":"sha256:ef59360bc24b8842f7b6b7d0ff5c0d08d33d8d06490aed926240fe37f54b8d13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O7Z6QKUY52524Z7IL7ZOFKTRUF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fault-Tolerant Metric Dimension of $P(n,2)$ with Prism Graph","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Q. Baig, M. Naeem, M. O. Ahmad, Z. Ahmad","submitted_at":"2018-11-14T05:59:36Z","abstract_excerpt":"Let $G$ be a connected graph and $d(a,b)$ be the distance between the vertices $a$ and $b$. A subset $U =\\{u_1,u_2,\\cdots,u_k\\}$ of the vertices is called a resolving set for $G$ if for every two distinct vertices $a,b \\in V(G)$, there is a vertex $u_\\xi \\in U$ such that $d(a,u_\\xi)\\neq d(b,u_\\xi)$. A resolving set containing a minimum number of vertices is called a metric basis for $G$ and the number of vertices in a metric basis is its metric dimension denoted by $dim(G)$. A resolving set $U$ for $G$ is fault-tolerant if $U \\setminus \\{u\\}$ is also a resolving set, for each $u \\in U$, and th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05973","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:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpDaJFtbyVKriUPBrpD7Mm1VkRhSxo5g0c/AcDl/t4JjnXZJFokh3+ZXxeAoYmF02ry3bQCk3LOCgQ0lbmQRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:11:30.895738Z"},"content_sha256":"493b2820f9d1042cbc08c68967417d5d10c67ce9a1e05a7d186e5a74f4b26ac9","schema_version":"1.0","event_id":"sha256:493b2820f9d1042cbc08c68967417d5d10c67ce9a1e05a7d186e5a74f4b26ac9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7Z6QKUY52524Z7IL7ZOFKTRUF/bundle.json","state_url":"https://pith.science/pith/O7Z6QKUY52524Z7IL7ZOFKTRUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7Z6QKUY52524Z7IL7ZOFKTRUF/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-07T22:11:30Z","links":{"resolver":"https://pith.science/pith/O7Z6QKUY52524Z7IL7ZOFKTRUF","bundle":"https://pith.science/pith/O7Z6QKUY52524Z7IL7ZOFKTRUF/bundle.json","state":"https://pith.science/pith/O7Z6QKUY52524Z7IL7ZOFKTRUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7Z6QKUY52524Z7IL7ZOFKTRUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O7Z6QKUY52524Z7IL7ZOFKTRUF","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":"258b6073d4b33b5b86878c93dbbb4ae18e7dbd8e7fc980b1d94cda94e942ebde","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-14T05:59:36Z","title_canon_sha256":"40b74355dfe3b2eef387837403d2961d041466528f3fea44db11a9d3eaca328d"},"schema_version":"1.0","source":{"id":"1811.05973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05973","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05973v1","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05973","created_at":"2026-05-18T00:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"O7Z6QKUY5252","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O7Z6QKUY52524Z7I","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O7Z6QKUY","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:493b2820f9d1042cbc08c68967417d5d10c67ce9a1e05a7d186e5a74f4b26ac9","target":"graph","created_at":"2026-05-18T00:00:38Z","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$ be a connected graph and $d(a,b)$ be the distance between the vertices $a$ and $b$. A subset $U =\\{u_1,u_2,\\cdots,u_k\\}$ of the vertices is called a resolving set for $G$ if for every two distinct vertices $a,b \\in V(G)$, there is a vertex $u_\\xi \\in U$ such that $d(a,u_\\xi)\\neq d(b,u_\\xi)$. A resolving set containing a minimum number of vertices is called a metric basis for $G$ and the number of vertices in a metric basis is its metric dimension denoted by $dim(G)$. A resolving set $U$ for $G$ is fault-tolerant if $U \\setminus \\{u\\}$ is also a resolving set, for each $u \\in U$, and th","authors_text":"A. Q. Baig, M. Naeem, M. O. Ahmad, Z. Ahmad","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-14T05:59:36Z","title":"Fault-Tolerant Metric Dimension of $P(n,2)$ with Prism Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05973","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:ef59360bc24b8842f7b6b7d0ff5c0d08d33d8d06490aed926240fe37f54b8d13","target":"record","created_at":"2026-05-18T00:00:38Z","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":"258b6073d4b33b5b86878c93dbbb4ae18e7dbd8e7fc980b1d94cda94e942ebde","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-14T05:59:36Z","title_canon_sha256":"40b74355dfe3b2eef387837403d2961d041466528f3fea44db11a9d3eaca328d"},"schema_version":"1.0","source":{"id":"1811.05973","kind":"arxiv","version":1}},"canonical_sha256":"77f3e82a98eebbae67e85ff2e2aa71a14772769d65f2cad647b15d4e4753de37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77f3e82a98eebbae67e85ff2e2aa71a14772769d65f2cad647b15d4e4753de37","first_computed_at":"2026-05-18T00:00:38.914342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:38.914342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qUgAnyBakCiDzqdPT4+HZSFJ5eoaKAFHmnUZOQX21xQcQCg/zVuHCPoJi8MQZQJGyMIvit4dM7nf8+tjWn0cCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:38.914779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05973","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef59360bc24b8842f7b6b7d0ff5c0d08d33d8d06490aed926240fe37f54b8d13","sha256:493b2820f9d1042cbc08c68967417d5d10c67ce9a1e05a7d186e5a74f4b26ac9"],"state_sha256":"866184ca573065fecafaf7b84df299c409eb24aace666efac683267bf8609fc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RGPuYN5eklSJNYd/0J78HYzkpoE7bYrXj2PXKWihPwABA58gB8FORQ7dL0ejigKHWIK16skm1Vgqsy/HMzWOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:11:30.899270Z","bundle_sha256":"f60bf075cf1310a4963a76a24e1cf01563854d91113253a5de189535d0afdaa5"}}