{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WYNZC4YY4YP4LPCT76SHCPK4J5","short_pith_number":"pith:WYNZC4YY","schema_version":"1.0","canonical_sha256":"b61b917318e61fc5bc53ffa4713d5c4f6193ae2b6cacd059a1bab3738b86a4c7","source":{"kind":"arxiv","id":"1401.0929","version":2},"attestation_state":"computed","paper":{"title":"Directed Metric Dimension of Oriented Graphs with Cyclic Covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rinovia Simanjuntak, Sigit Pancahayani","submitted_at":"2014-01-05T19:00:22Z","abstract_excerpt":"Let $D$ be a strongly connected oriented graph with vertex-set $V$ and arc-set $A$. The distance from a vertex $u$ to another vertex $v$, $d(u,v)$ is the minimum length of oriented paths from $u$ to $v$. Suppose $B=\\{b_1,b_2,b_3,...b_k\\}$ is a nonempty ordered subset of $V$. The representation of a vertex $v$ with respect to $B$, $r(v|B)$, is defined as a vector $(d(v,b_1), d(v,b_2), ..., d(v,b_k))$. If any two distinct vertices $u,v$ satisfy $r(u|B)\\neq r(v|B)$, then $B$ is said to be a resolving set of $D$. If the cardinality of $B$ is minimum then $B$ is said to be a basis of $D$ and the ca"},"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.0929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-05T19:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"c1df85dabc3ef0457bea45ead64948183f214d1b3274feb83084c512e6e3be58","abstract_canon_sha256":"11fe660083233391bba040313e58cf678990c76c6b71bf8955a92603df41f606"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:50.975745Z","signature_b64":"AHNBeGm1i3CTy02GJg6KylQxzGmMobKZgN7ud8nh2Ze/P5unQW3Csxdy6yHI03itL7ItOhG24nccpV+5rqulDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b61b917318e61fc5bc53ffa4713d5c4f6193ae2b6cacd059a1bab3738b86a4c7","last_reissued_at":"2026-05-18T01:23:50.975014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:50.975014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed Metric Dimension of Oriented Graphs with Cyclic Covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rinovia Simanjuntak, Sigit Pancahayani","submitted_at":"2014-01-05T19:00:22Z","abstract_excerpt":"Let $D$ be a strongly connected oriented graph with vertex-set $V$ and arc-set $A$. The distance from a vertex $u$ to another vertex $v$, $d(u,v)$ is the minimum length of oriented paths from $u$ to $v$. Suppose $B=\\{b_1,b_2,b_3,...b_k\\}$ is a nonempty ordered subset of $V$. The representation of a vertex $v$ with respect to $B$, $r(v|B)$, is defined as a vector $(d(v,b_1), d(v,b_2), ..., d(v,b_k))$. If any two distinct vertices $u,v$ satisfy $r(u|B)\\neq r(v|B)$, then $B$ is said to be a resolving set of $D$. If the cardinality of $B$ is minimum then $B$ is said to be a basis of $D$ and the ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0929","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.0929","created_at":"2026-05-18T01:23:50.975134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0929v2","created_at":"2026-05-18T01:23:50.975134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0929","created_at":"2026-05-18T01:23:50.975134+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYNZC4YY4YP4","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYNZC4YY4YP4LPCT","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYNZC4YY","created_at":"2026-05-18T12:28:54.890064+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/WYNZC4YY4YP4LPCT76SHCPK4J5","json":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5.json","graph_json":"https://pith.science/api/pith-number/WYNZC4YY4YP4LPCT76SHCPK4J5/graph.json","events_json":"https://pith.science/api/pith-number/WYNZC4YY4YP4LPCT76SHCPK4J5/events.json","paper":"https://pith.science/paper/WYNZC4YY"},"agent_actions":{"view_html":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5","download_json":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5.json","view_paper":"https://pith.science/paper/WYNZC4YY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0929&json=true","fetch_graph":"https://pith.science/api/pith-number/WYNZC4YY4YP4LPCT76SHCPK4J5/graph.json","fetch_events":"https://pith.science/api/pith-number/WYNZC4YY4YP4LPCT76SHCPK4J5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5/action/storage_attestation","attest_author":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5/action/author_attestation","sign_citation":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5/action/citation_signature","submit_replication":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5/action/replication_record"}},"created_at":"2026-05-18T01:23:50.975134+00:00","updated_at":"2026-05-18T01:23:50.975134+00:00"}