{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WYNZC4YY4YP4LPCT76SHCPK4J5","short_pith_number":"pith:WYNZC4YY","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"},"canonical_sha256":"b61b917318e61fc5bc53ffa4713d5c4f6193ae2b6cacd059a1bab3738b86a4c7","source":{"kind":"arxiv","id":"1401.0929","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0929","created_at":"2026-05-18T01:23:50Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0929v2","created_at":"2026-05-18T01:23:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0929","created_at":"2026-05-18T01:23:50Z"},{"alias_kind":"pith_short_12","alias_value":"WYNZC4YY4YP4","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WYNZC4YY4YP4LPCT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WYNZC4YY","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WYNZC4YY4YP4LPCT76SHCPK4J5","target":"record","payload":{"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"},"canonical_sha256":"b61b917318e61fc5bc53ffa4713d5c4f6193ae2b6cacd059a1bab3738b86a4c7","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"},"source_kind":"arxiv","source_id":"1401.0929","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:23:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L/R5AYQbRSP/Gg598HGar6qMFKSEy+7pFDIm64rXxcpvaxhx4u44ajJiaDA/lFIZgwiJeYOJLA+4TIDGCSOMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:28:59.586282Z"},"content_sha256":"36ec2406f083214cd5620091321d6f41e3891afe948e3266737941eb0fae9069","schema_version":"1.0","event_id":"sha256:36ec2406f083214cd5620091321d6f41e3891afe948e3266737941eb0fae9069"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WYNZC4YY4YP4LPCT76SHCPK4J5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:23:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RttpNRtq3mqacqtHeD/UZCy6oLkDuDxgroMbMwQOOvx13ifaZo6cIdw2a6g9Uysi+HtyijmggP7xCaJ7Cr1kCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:28:59.586658Z"},"content_sha256":"fd5ca83a8af74fdc4524fdbffc8bd14f01b5007607e887ac47a52f9203345948","schema_version":"1.0","event_id":"sha256:fd5ca83a8af74fdc4524fdbffc8bd14f01b5007607e887ac47a52f9203345948"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5/bundle.json","state_url":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WYNZC4YY4YP4LPCT76SHCPK4J5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T06:28:59Z","links":{"resolver":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5","bundle":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5/bundle.json","state":"https://pith.science/pith/WYNZC4YY4YP4LPCT76SHCPK4J5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WYNZC4YY4YP4LPCT76SHCPK4J5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WYNZC4YY4YP4LPCT76SHCPK4J5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"11fe660083233391bba040313e58cf678990c76c6b71bf8955a92603df41f606","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-05T19:00:22Z","title_canon_sha256":"c1df85dabc3ef0457bea45ead64948183f214d1b3274feb83084c512e6e3be58"},"schema_version":"1.0","source":{"id":"1401.0929","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0929","created_at":"2026-05-18T01:23:50Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0929v2","created_at":"2026-05-18T01:23:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0929","created_at":"2026-05-18T01:23:50Z"},{"alias_kind":"pith_short_12","alias_value":"WYNZC4YY4YP4","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WYNZC4YY4YP4LPCT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WYNZC4YY","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:fd5ca83a8af74fdc4524fdbffc8bd14f01b5007607e887ac47a52f9203345948","target":"graph","created_at":"2026-05-18T01:23:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Rinovia Simanjuntak, Sigit Pancahayani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-05T19:00:22Z","title":"Directed Metric Dimension of Oriented Graphs with Cyclic Covering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0929","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:36ec2406f083214cd5620091321d6f41e3891afe948e3266737941eb0fae9069","target":"record","created_at":"2026-05-18T01:23:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"11fe660083233391bba040313e58cf678990c76c6b71bf8955a92603df41f606","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-05T19:00:22Z","title_canon_sha256":"c1df85dabc3ef0457bea45ead64948183f214d1b3274feb83084c512e6e3be58"},"schema_version":"1.0","source":{"id":"1401.0929","kind":"arxiv","version":2}},"canonical_sha256":"b61b917318e61fc5bc53ffa4713d5c4f6193ae2b6cacd059a1bab3738b86a4c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b61b917318e61fc5bc53ffa4713d5c4f6193ae2b6cacd059a1bab3738b86a4c7","first_computed_at":"2026-05-18T01:23:50.975014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:50.975014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AHNBeGm1i3CTy02GJg6KylQxzGmMobKZgN7ud8nh2Ze/P5unQW3Csxdy6yHI03itL7ItOhG24nccpV+5rqulDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:50.975745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0929","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36ec2406f083214cd5620091321d6f41e3891afe948e3266737941eb0fae9069","sha256:fd5ca83a8af74fdc4524fdbffc8bd14f01b5007607e887ac47a52f9203345948"],"state_sha256":"7e0152c7c80295b2e6cb19b505c07a33e9736d0d18f00a1bfbda100e784f2b6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5XYG1QHD7bJbbZ4xBeYCnzykDdjb3x1sfRbh1LcBoFTNccz40v9iAINvptQhryznEyHSPqHBoEzwFUUT+x0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:28:59.588664Z","bundle_sha256":"6222f25f1937d168b153a54a232e2a62f38dee39dcdaad4bab4a6d5b93784aa0"}}