{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IOO7OZR2OQDMPTEBXY7N6TV3RX","short_pith_number":"pith:IOO7OZR2","schema_version":"1.0","canonical_sha256":"439df7663a7406c7cc81be3edf4ebb8dd2fe6dc7f2c7d5153902f11526182443","source":{"kind":"arxiv","id":"1807.02365","version":1},"attestation_state":"computed","paper":{"title":"On minimal edge version of doubly resolving sets of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Muhammad Ahmad, Sohail Zafar, Zohaib Zahid","submitted_at":"2018-07-06T11:48:50Z","abstract_excerpt":"In this paper, we introduce the edge version of doubly resolving set of a graph which is based on the edge distances of the graph. As a main result, we computed the minimum cardinality $\\psi_E$ of edge version of doubly resolving sets of family of $n$-sunlet graph $S_n$ and prism graph $Y_n$."},"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":"1807.02365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-06T11:48:50Z","cross_cats_sorted":[],"title_canon_sha256":"4e2640e0d9a4632a69eeccef21c20ef8ade54161592effeefa0eb2d0a4630cdc","abstract_canon_sha256":"45bbb09f36fb759a4f8fa930d6c61f3ea37f9a156a2a1e7e8b0bc13c5e6b2b4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:22.290093Z","signature_b64":"zQQelO0QtLVY46t8TF037kJZ+e/2K3H40E1OxM6CGoNfNdSSiGH32dKN6hXIrIPDZzu72cINDeS/b8/ugxXODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"439df7663a7406c7cc81be3edf4ebb8dd2fe6dc7f2c7d5153902f11526182443","last_reissued_at":"2026-05-18T00:11:22.289365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:22.289365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On minimal edge version of doubly resolving sets of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Muhammad Ahmad, Sohail Zafar, Zohaib Zahid","submitted_at":"2018-07-06T11:48:50Z","abstract_excerpt":"In this paper, we introduce the edge version of doubly resolving set of a graph which is based on the edge distances of the graph. As a main result, we computed the minimum cardinality $\\psi_E$ of edge version of doubly resolving sets of family of $n$-sunlet graph $S_n$ and prism graph $Y_n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02365","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.02365","created_at":"2026-05-18T00:11:22.289510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02365v1","created_at":"2026-05-18T00:11:22.289510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02365","created_at":"2026-05-18T00:11:22.289510+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOO7OZR2OQDM","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOO7OZR2OQDMPTEB","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOO7OZR2","created_at":"2026-05-18T12:32:31.084164+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/IOO7OZR2OQDMPTEBXY7N6TV3RX","json":"https://pith.science/pith/IOO7OZR2OQDMPTEBXY7N6TV3RX.json","graph_json":"https://pith.science/api/pith-number/IOO7OZR2OQDMPTEBXY7N6TV3RX/graph.json","events_json":"https://pith.science/api/pith-number/IOO7OZR2OQDMPTEBXY7N6TV3RX/events.json","paper":"https://pith.science/paper/IOO7OZR2"},"agent_actions":{"view_html":"https://pith.science/pith/IOO7OZR2OQDMPTEBXY7N6TV3RX","download_json":"https://pith.science/pith/IOO7OZR2OQDMPTEBXY7N6TV3RX.json","view_paper":"https://pith.science/paper/IOO7OZR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02365&json=true","fetch_graph":"https://pith.science/api/pith-number/IOO7OZR2OQDMPTEBXY7N6TV3RX/graph.json","fetch_events":"https://pith.science/api/pith-number/IOO7OZR2OQDMPTEBXY7N6TV3RX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOO7OZR2OQDMPTEBXY7N6TV3RX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOO7OZR2OQDMPTEBXY7N6TV3RX/action/storage_attestation","attest_author":"https://pith.science/pith/IOO7OZR2OQDMPTEBXY7N6TV3RX/action/author_attestation","sign_citation":"https://pith.science/pith/IOO7OZR2OQDMPTEBXY7N6TV3RX/action/citation_signature","submit_replication":"https://pith.science/pith/IOO7OZR2OQDMPTEBXY7N6TV3RX/action/replication_record"}},"created_at":"2026-05-18T00:11:22.289510+00:00","updated_at":"2026-05-18T00:11:22.289510+00:00"}