{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PSSPMPEQO6NLRL3BH272EHN3RW","short_pith_number":"pith:PSSPMPEQ","schema_version":"1.0","canonical_sha256":"7ca4f63c90779ab8af613ebfa21dbb8d9478fb1093543c181c1a2c88f8f21c27","source":{"kind":"arxiv","id":"1401.3008","version":2},"attestation_state":"computed","paper":{"title":"A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong X. Kang, Eunjeong Yi","submitted_at":"2014-01-13T21:05:43Z","abstract_excerpt":"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)-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. The \\emph{strong metric dimension}, $sdim(G)$, of a graph $G$ is the minimum among cardinalities of all strong resolving sets: $W \\subseteq V(G)$ is a \\emph{strong resolving set} of $G$ if for any $u, v \\in V(G)$, there exists an $x \\in W$ such that either $"},"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":"1401.3008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T21:05:43Z","cross_cats_sorted":[],"title_canon_sha256":"b7eb4a463be8ac2757d4aa4b7132161dff37a18a07b75287b43c36206b27f1cf","abstract_canon_sha256":"d30a6812bd9880d85662cc15a277db4c3e0dd26956e6f34325fdb3eba29b4cb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:38.303741Z","signature_b64":"1JwywKx8femd2Qg/F1q2dFdCWHYinYAyT5g46Ibbspdf4sI9xEVNxQakyW4hM8x7J42en6Jz2RADWfQk110GBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ca4f63c90779ab8af613ebfa21dbb8d9478fb1093543c181c1a2c88f8f21c27","last_reissued_at":"2026-05-18T02:31:38.303084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:38.303084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong X. Kang, Eunjeong Yi","submitted_at":"2014-01-13T21:05:43Z","abstract_excerpt":"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)-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. The \\emph{strong metric dimension}, $sdim(G)$, of a graph $G$ is the minimum among cardinalities of all strong resolving sets: $W \\subseteq V(G)$ is a \\emph{strong resolving set} of $G$ if for any $u, v \\in V(G)$, there exists an $x \\in W$ such that either $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3008","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":"1401.3008","created_at":"2026-05-18T02:31:38.303181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3008v2","created_at":"2026-05-18T02:31:38.303181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3008","created_at":"2026-05-18T02:31:38.303181+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSSPMPEQO6NL","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSSPMPEQO6NLRL3B","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSSPMPEQ","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/PSSPMPEQO6NLRL3BH272EHN3RW","json":"https://pith.science/pith/PSSPMPEQO6NLRL3BH272EHN3RW.json","graph_json":"https://pith.science/api/pith-number/PSSPMPEQO6NLRL3BH272EHN3RW/graph.json","events_json":"https://pith.science/api/pith-number/PSSPMPEQO6NLRL3BH272EHN3RW/events.json","paper":"https://pith.science/paper/PSSPMPEQ"},"agent_actions":{"view_html":"https://pith.science/pith/PSSPMPEQO6NLRL3BH272EHN3RW","download_json":"https://pith.science/pith/PSSPMPEQO6NLRL3BH272EHN3RW.json","view_paper":"https://pith.science/paper/PSSPMPEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3008&json=true","fetch_graph":"https://pith.science/api/pith-number/PSSPMPEQO6NLRL3BH272EHN3RW/graph.json","fetch_events":"https://pith.science/api/pith-number/PSSPMPEQO6NLRL3BH272EHN3RW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSSPMPEQO6NLRL3BH272EHN3RW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSSPMPEQO6NLRL3BH272EHN3RW/action/storage_attestation","attest_author":"https://pith.science/pith/PSSPMPEQO6NLRL3BH272EHN3RW/action/author_attestation","sign_citation":"https://pith.science/pith/PSSPMPEQO6NLRL3BH272EHN3RW/action/citation_signature","submit_replication":"https://pith.science/pith/PSSPMPEQO6NLRL3BH272EHN3RW/action/replication_record"}},"created_at":"2026-05-18T02:31:38.303181+00:00","updated_at":"2026-05-18T02:31:38.303181+00:00"}