{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:54JAF6G7XB2W3I7VER5UHGFVOZ","short_pith_number":"pith:54JAF6G7","schema_version":"1.0","canonical_sha256":"ef1202f8dfb8756da3f5247b4398b5766f5704c09b99a2901568093eb9fcb14f","source":{"kind":"arxiv","id":"2011.12038","version":2},"attestation_state":"computed","paper":{"title":"On weak metric dimension of digraphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng, Yuefeng Yang","submitted_at":"2020-11-24T11:31:21Z","abstract_excerpt":"Using the two way distance, we introduce the concepts of weak metric dimension of a strongly connected digraph $\\Gamma$. We first establish lower and upper bounds for the number of arcs in $\\Gamma$ by using the diameter and weak metric dimension of $\\Gamma$, and characterize all digraphs attaining the lower or upper bound. Then we study a digraph with weak metric dimension $1$ and classify all vertex-transitive digraphs having weak metric dimension $1$. Finally, all digraphs of order $n$ with weak metric dimension $n-1$ or $n-2$ are determined."},"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":"2011.12038","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2020-11-24T11:31:21Z","cross_cats_sorted":[],"title_canon_sha256":"fe03eaba456f7666f927163ac3ceae0ffdd78721f6ee6bdc516d75add8a6e7f6","abstract_canon_sha256":"7bc4111ce0e583e8af56a03c634b0c05db975ea2876fa2eb282e01c7432082cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:57:21.946551Z","signature_b64":"KfZxpMoTlL/KH6JN/tyislo8txHnvbC/OpG4XBWf64XivW1kc9/McWNJ7dyJxKSvBrEehTpPlzhteqJAio6OBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef1202f8dfb8756da3f5247b4398b5766f5704c09b99a2901568093eb9fcb14f","last_reissued_at":"2026-07-05T01:57:21.946076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:57:21.946076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On weak metric dimension of digraphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng, Yuefeng Yang","submitted_at":"2020-11-24T11:31:21Z","abstract_excerpt":"Using the two way distance, we introduce the concepts of weak metric dimension of a strongly connected digraph $\\Gamma$. We first establish lower and upper bounds for the number of arcs in $\\Gamma$ by using the diameter and weak metric dimension of $\\Gamma$, and characterize all digraphs attaining the lower or upper bound. Then we study a digraph with weak metric dimension $1$ and classify all vertex-transitive digraphs having weak metric dimension $1$. Finally, all digraphs of order $n$ with weak metric dimension $n-1$ or $n-2$ are determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.12038","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.12038/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":"2011.12038","created_at":"2026-07-05T01:57:21.946138+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.12038v2","created_at":"2026-07-05T01:57:21.946138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.12038","created_at":"2026-07-05T01:57:21.946138+00:00"},{"alias_kind":"pith_short_12","alias_value":"54JAF6G7XB2W","created_at":"2026-07-05T01:57:21.946138+00:00"},{"alias_kind":"pith_short_16","alias_value":"54JAF6G7XB2W3I7V","created_at":"2026-07-05T01:57:21.946138+00:00"},{"alias_kind":"pith_short_8","alias_value":"54JAF6G7","created_at":"2026-07-05T01:57:21.946138+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/54JAF6G7XB2W3I7VER5UHGFVOZ","json":"https://pith.science/pith/54JAF6G7XB2W3I7VER5UHGFVOZ.json","graph_json":"https://pith.science/api/pith-number/54JAF6G7XB2W3I7VER5UHGFVOZ/graph.json","events_json":"https://pith.science/api/pith-number/54JAF6G7XB2W3I7VER5UHGFVOZ/events.json","paper":"https://pith.science/paper/54JAF6G7"},"agent_actions":{"view_html":"https://pith.science/pith/54JAF6G7XB2W3I7VER5UHGFVOZ","download_json":"https://pith.science/pith/54JAF6G7XB2W3I7VER5UHGFVOZ.json","view_paper":"https://pith.science/paper/54JAF6G7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.12038&json=true","fetch_graph":"https://pith.science/api/pith-number/54JAF6G7XB2W3I7VER5UHGFVOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/54JAF6G7XB2W3I7VER5UHGFVOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54JAF6G7XB2W3I7VER5UHGFVOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54JAF6G7XB2W3I7VER5UHGFVOZ/action/storage_attestation","attest_author":"https://pith.science/pith/54JAF6G7XB2W3I7VER5UHGFVOZ/action/author_attestation","sign_citation":"https://pith.science/pith/54JAF6G7XB2W3I7VER5UHGFVOZ/action/citation_signature","submit_replication":"https://pith.science/pith/54JAF6G7XB2W3I7VER5UHGFVOZ/action/replication_record"}},"created_at":"2026-07-05T01:57:21.946138+00:00","updated_at":"2026-07-05T01:57:21.946138+00:00"}