{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GNEQZBHEJDGZMOGRCK2NLBQWWP","short_pith_number":"pith:GNEQZBHE","canonical_record":{"source":{"id":"1408.1390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-06T19:59:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a8598e4e770db515d30345229966c499b59000a522be75b27224fa3f69f7651d","abstract_canon_sha256":"688a304b809e1fc3faed7c1418637254f975f3fa31821d2a0fb4cd9eb87df981"},"schema_version":"1.0"},"canonical_sha256":"33490c84e448cd9638d112b4d58616b3ccea9c679638897227fcbc1df6445486","source":{"kind":"arxiv","id":"1408.1390","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1390","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1390v2","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1390","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"GNEQZBHEJDGZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GNEQZBHEJDGZMOGR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GNEQZBHE","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GNEQZBHEJDGZMOGRCK2NLBQWWP","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-06T19:59:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a8598e4e770db515d30345229966c499b59000a522be75b27224fa3f69f7651d","abstract_canon_sha256":"688a304b809e1fc3faed7c1418637254f975f3fa31821d2a0fb4cd9eb87df981"},"schema_version":"1.0"},"canonical_sha256":"33490c84e448cd9638d112b4d58616b3ccea9c679638897227fcbc1df6445486","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:55.940184Z","signature_b64":"MHGFA9+ZrAxas7BXyHaHjlr3irsACaWRNQ0MWEqmIKFmByt2f+5P8/E3kQQznXA3l9QieetTbgXGCFg8FjSSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33490c84e448cd9638d112b4d58616b3ccea9c679638897227fcbc1df6445486","last_reissued_at":"2026-05-18T00:07:55.939518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:55.939518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1390","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-18T00:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQ4+poNZf71fBZECfTrd1VlVKFONUqHLiszyBQh3FbDTflOXC8QT5Jhcw+Y/BmwCs3yipaNpk4v1iBKgyDAZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:56:16.562882Z"},"content_sha256":"41a8febd95fb9537d9cbc5e13b7c97e38f8b4a80116f94293df83d6715b8299e","schema_version":"1.0","event_id":"sha256:41a8febd95fb9537d9cbc5e13b7c97e38f8b4a80116f94293df83d6715b8299e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GNEQZBHEJDGZMOGRCK2NLBQWWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On optimal approximability results for computing the strong metric dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Bhaskar DasGupta, Nasim Mobasheri","submitted_at":"2014-08-06T19:59:56Z","abstract_excerpt":"The strong metric dimension of a graph was first introduced by Seb\\\"{o} and Tannier (Mathematics of Operations Research, 29(2), 383-393, 2004) as an alternative to the (weak) metric dimension of graphs previously introduced independently by Slater (Proc. 6th Southeastern Conference on Combinatorics, Graph Theory, and Computing, 549-559, 1975) and by Harary and Melter (Ars Combinatoria, 2, 191-195, 1976), and has since been investigated in several research papers. However, the exact worst-case computational complexity of computing the strong metric dimension has remained open beyond being NP-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1390","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-18T00:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kFus0tnB6Fl5ByfIFdLcQWCAYBR/GmePKioyDOmP8J9ykme/jzZrojBCflNKtUBG9DTmb7417PMGaZkgsavrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:56:16.563304Z"},"content_sha256":"d7c78550adc64096c8392c8246816825f814fda1936b6fccdaa52a39b580862b","schema_version":"1.0","event_id":"sha256:d7c78550adc64096c8392c8246816825f814fda1936b6fccdaa52a39b580862b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNEQZBHEJDGZMOGRCK2NLBQWWP/bundle.json","state_url":"https://pith.science/pith/GNEQZBHEJDGZMOGRCK2NLBQWWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNEQZBHEJDGZMOGRCK2NLBQWWP/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-28T13:56:16Z","links":{"resolver":"https://pith.science/pith/GNEQZBHEJDGZMOGRCK2NLBQWWP","bundle":"https://pith.science/pith/GNEQZBHEJDGZMOGRCK2NLBQWWP/bundle.json","state":"https://pith.science/pith/GNEQZBHEJDGZMOGRCK2NLBQWWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNEQZBHEJDGZMOGRCK2NLBQWWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GNEQZBHEJDGZMOGRCK2NLBQWWP","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":"688a304b809e1fc3faed7c1418637254f975f3fa31821d2a0fb4cd9eb87df981","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-06T19:59:56Z","title_canon_sha256":"a8598e4e770db515d30345229966c499b59000a522be75b27224fa3f69f7651d"},"schema_version":"1.0","source":{"id":"1408.1390","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1390","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1390v2","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1390","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"GNEQZBHEJDGZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GNEQZBHEJDGZMOGR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GNEQZBHE","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:d7c78550adc64096c8392c8246816825f814fda1936b6fccdaa52a39b580862b","target":"graph","created_at":"2026-05-18T00:07:55Z","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":"The strong metric dimension of a graph was first introduced by Seb\\\"{o} and Tannier (Mathematics of Operations Research, 29(2), 383-393, 2004) as an alternative to the (weak) metric dimension of graphs previously introduced independently by Slater (Proc. 6th Southeastern Conference on Combinatorics, Graph Theory, and Computing, 549-559, 1975) and by Harary and Melter (Ars Combinatoria, 2, 191-195, 1976), and has since been investigated in several research papers. However, the exact worst-case computational complexity of computing the strong metric dimension has remained open beyond being NP-co","authors_text":"Bhaskar DasGupta, Nasim Mobasheri","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-06T19:59:56Z","title":"On optimal approximability results for computing the strong metric dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1390","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:41a8febd95fb9537d9cbc5e13b7c97e38f8b4a80116f94293df83d6715b8299e","target":"record","created_at":"2026-05-18T00:07:55Z","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":"688a304b809e1fc3faed7c1418637254f975f3fa31821d2a0fb4cd9eb87df981","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-06T19:59:56Z","title_canon_sha256":"a8598e4e770db515d30345229966c499b59000a522be75b27224fa3f69f7651d"},"schema_version":"1.0","source":{"id":"1408.1390","kind":"arxiv","version":2}},"canonical_sha256":"33490c84e448cd9638d112b4d58616b3ccea9c679638897227fcbc1df6445486","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33490c84e448cd9638d112b4d58616b3ccea9c679638897227fcbc1df6445486","first_computed_at":"2026-05-18T00:07:55.939518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:55.939518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MHGFA9+ZrAxas7BXyHaHjlr3irsACaWRNQ0MWEqmIKFmByt2f+5P8/E3kQQznXA3l9QieetTbgXGCFg8FjSSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:55.940184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1390","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41a8febd95fb9537d9cbc5e13b7c97e38f8b4a80116f94293df83d6715b8299e","sha256:d7c78550adc64096c8392c8246816825f814fda1936b6fccdaa52a39b580862b"],"state_sha256":"79f2b4e77360b9e8f93b6c7376cb1c22c82875d9e82edf3f7dcc3cbf6a6d1583"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7jCynvs5XgVQBropzoAdeYSaHnpKxMdWR9XNULq8p0F//kdIU/EpMTI0XHKUKiy3GM9KPNzRT+Fkfhm6wnzLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:56:16.566359Z","bundle_sha256":"b8ea0b450392abd1580dd541943e594bf229aec59c04a5ef14f18fe6ab76c35c"}}