{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PL4GFH6KSD4CYV3PEHHLADN6PH","short_pith_number":"pith:PL4GFH6K","schema_version":"1.0","canonical_sha256":"7af8629fca90f82c576f21ceb00dbe79fa4c0e7643fd81a5a5ff22409d74f090","source":{"kind":"arxiv","id":"1408.5943","version":2},"attestation_state":"computed","paper":{"title":"A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong X. Kang, Eunjeong Yi, Linda Eroh","submitted_at":"2014-08-25T23:05:35Z","abstract_excerpt":"The \\emph{metric dimension} $\\dim(G)$ of a graph $G$ is the minimum number of vertices such that every vertex of $G$ is uniquely determined by its vector of distances to the chosen vertices. The \\emph{zero forcing number} $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)\\!\\setminus\\!S$ are colored white) such that $V(G)$ is turned black after finitely many applications of \"the color-change rule\": a white vertex is converted black if it is the only white neighbor of a black vertex. We show that $\\dim(T) \\leq Z(T)$ for a tree $T$, and that"},"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":"1408.5943","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-25T23:05:35Z","cross_cats_sorted":[],"title_canon_sha256":"2c484fd17b1b6e4b2ab073997055acbb7db41dca7af92622ac34545e2eadb6a1","abstract_canon_sha256":"4c516475e37cc9c4c9b36dd5f2fce8eb8f0ca010ab402dece7ebd52fba0b96ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:13.749381Z","signature_b64":"DNOIzig3jhA44nGgKiu0WSbSthedEmZdxJTQ67mE+0usKtXNu6t6Vbb4AkbuNzHtUPVyLTcTDzjVIt3voh0vCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7af8629fca90f82c576f21ceb00dbe79fa4c0e7643fd81a5a5ff22409d74f090","last_reissued_at":"2026-05-18T00:42:13.748470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:13.748470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong X. Kang, Eunjeong Yi, Linda Eroh","submitted_at":"2014-08-25T23:05:35Z","abstract_excerpt":"The \\emph{metric dimension} $\\dim(G)$ of a graph $G$ is the minimum number of vertices such that every vertex of $G$ is uniquely determined by its vector of distances to the chosen vertices. The \\emph{zero forcing number} $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)\\!\\setminus\\!S$ are colored white) such that $V(G)$ is turned black after finitely many applications of \"the color-change rule\": a white vertex is converted black if it is the only white neighbor of a black vertex. We show that $\\dim(T) \\leq Z(T)$ for a tree $T$, and that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5943","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.5943","created_at":"2026-05-18T00:42:13.748596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5943v2","created_at":"2026-05-18T00:42:13.748596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5943","created_at":"2026-05-18T00:42:13.748596+00:00"},{"alias_kind":"pith_short_12","alias_value":"PL4GFH6KSD4C","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PL4GFH6KSD4CYV3P","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PL4GFH6K","created_at":"2026-05-18T12:28:43.426989+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/PL4GFH6KSD4CYV3PEHHLADN6PH","json":"https://pith.science/pith/PL4GFH6KSD4CYV3PEHHLADN6PH.json","graph_json":"https://pith.science/api/pith-number/PL4GFH6KSD4CYV3PEHHLADN6PH/graph.json","events_json":"https://pith.science/api/pith-number/PL4GFH6KSD4CYV3PEHHLADN6PH/events.json","paper":"https://pith.science/paper/PL4GFH6K"},"agent_actions":{"view_html":"https://pith.science/pith/PL4GFH6KSD4CYV3PEHHLADN6PH","download_json":"https://pith.science/pith/PL4GFH6KSD4CYV3PEHHLADN6PH.json","view_paper":"https://pith.science/paper/PL4GFH6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5943&json=true","fetch_graph":"https://pith.science/api/pith-number/PL4GFH6KSD4CYV3PEHHLADN6PH/graph.json","fetch_events":"https://pith.science/api/pith-number/PL4GFH6KSD4CYV3PEHHLADN6PH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PL4GFH6KSD4CYV3PEHHLADN6PH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PL4GFH6KSD4CYV3PEHHLADN6PH/action/storage_attestation","attest_author":"https://pith.science/pith/PL4GFH6KSD4CYV3PEHHLADN6PH/action/author_attestation","sign_citation":"https://pith.science/pith/PL4GFH6KSD4CYV3PEHHLADN6PH/action/citation_signature","submit_replication":"https://pith.science/pith/PL4GFH6KSD4CYV3PEHHLADN6PH/action/replication_record"}},"created_at":"2026-05-18T00:42:13.748596+00:00","updated_at":"2026-05-18T00:42:13.748596+00:00"}