{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A226A6NZLBB7A7ASDOM6RA5GDV","short_pith_number":"pith:A226A6NZ","schema_version":"1.0","canonical_sha256":"06b5e079b95843f07c121b99e883a61d7ddd33e6f58b138735743987b5e6fa64","source":{"kind":"arxiv","id":"2409.12199","version":1},"attestation_state":"computed","paper":{"title":"Fault Tolerant Metric Dimensions of Leafless Cacti Graphs with Application in Supply Chain Management","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Faisal Yousafzai, Ghulam Haidar, Murad Ul Islam Khan, Qaisar Khan, Rakea Fatima, Tauseef Asif","submitted_at":"2024-09-09T07:38:15Z","abstract_excerpt":"A resolving set for a simple graph $G$ is a subset of vertex set of $G$ such that it distinguishes all vertices of $G$ using the shortest distance from this subset. This subset is a metric basis if it is the smallest set with this property. A resolving set is a fault tolerant resolving set if the removal of any vertex from the subset still leaves it a resolving set. The smallest set satisfying this property is the fault tolerant metric basis, and the cardinality of this set is termed as fault tolerant metric dimension of $G$, denoted by $\\beta'(G)$. In this article, we determine the fault tole"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2409.12199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-09-09T07:38:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9e0c9dfdbe1a6e8f903e687d3dbe6c917c5ac067099eb0ce955e2ea730ca52dc","abstract_canon_sha256":"c17d81206502a54b706432427d87d00933050d072b608ad275f2f5145d1ecdbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:40.429131Z","signature_b64":"RN7ByiMnEjw9tjcq0jeLifoH6R1uRMFyjwXY6hzwohvdDIQdgSgMPjMDbESNeNau+RrK/ftk1pxUyLH6Is1eBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06b5e079b95843f07c121b99e883a61d7ddd33e6f58b138735743987b5e6fa64","last_reissued_at":"2026-05-22T01:03:40.428241Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:40.428241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault Tolerant Metric Dimensions of Leafless Cacti Graphs with Application in Supply Chain Management","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Faisal Yousafzai, Ghulam Haidar, Murad Ul Islam Khan, Qaisar Khan, Rakea Fatima, Tauseef Asif","submitted_at":"2024-09-09T07:38:15Z","abstract_excerpt":"A resolving set for a simple graph $G$ is a subset of vertex set of $G$ such that it distinguishes all vertices of $G$ using the shortest distance from this subset. This subset is a metric basis if it is the smallest set with this property. A resolving set is a fault tolerant resolving set if the removal of any vertex from the subset still leaves it a resolving set. The smallest set satisfying this property is the fault tolerant metric basis, and the cardinality of this set is termed as fault tolerant metric dimension of $G$, denoted by $\\beta'(G)$. In this article, we determine the fault tole"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12199","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.12199/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.12199","created_at":"2026-05-22T01:03:40.428379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.12199v1","created_at":"2026-05-22T01:03:40.428379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12199","created_at":"2026-05-22T01:03:40.428379+00:00"},{"alias_kind":"pith_short_12","alias_value":"A226A6NZLBB7","created_at":"2026-05-22T01:03:40.428379+00:00"},{"alias_kind":"pith_short_16","alias_value":"A226A6NZLBB7A7AS","created_at":"2026-05-22T01:03:40.428379+00:00"},{"alias_kind":"pith_short_8","alias_value":"A226A6NZ","created_at":"2026-05-22T01:03:40.428379+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A226A6NZLBB7A7ASDOM6RA5GDV","json":"https://pith.science/pith/A226A6NZLBB7A7ASDOM6RA5GDV.json","graph_json":"https://pith.science/api/pith-number/A226A6NZLBB7A7ASDOM6RA5GDV/graph.json","events_json":"https://pith.science/api/pith-number/A226A6NZLBB7A7ASDOM6RA5GDV/events.json","paper":"https://pith.science/paper/A226A6NZ"},"agent_actions":{"view_html":"https://pith.science/pith/A226A6NZLBB7A7ASDOM6RA5GDV","download_json":"https://pith.science/pith/A226A6NZLBB7A7ASDOM6RA5GDV.json","view_paper":"https://pith.science/paper/A226A6NZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.12199&json=true","fetch_graph":"https://pith.science/api/pith-number/A226A6NZLBB7A7ASDOM6RA5GDV/graph.json","fetch_events":"https://pith.science/api/pith-number/A226A6NZLBB7A7ASDOM6RA5GDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A226A6NZLBB7A7ASDOM6RA5GDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A226A6NZLBB7A7ASDOM6RA5GDV/action/storage_attestation","attest_author":"https://pith.science/pith/A226A6NZLBB7A7ASDOM6RA5GDV/action/author_attestation","sign_citation":"https://pith.science/pith/A226A6NZLBB7A7ASDOM6RA5GDV/action/citation_signature","submit_replication":"https://pith.science/pith/A226A6NZLBB7A7ASDOM6RA5GDV/action/replication_record"}},"created_at":"2026-05-22T01:03:40.428379+00:00","updated_at":"2026-05-22T01:03:40.428379+00:00"}