{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QEBBV7XHOVZGUVG2PV3FIZLEL5","short_pith_number":"pith:QEBBV7XH","canonical_record":{"source":{"id":"1111.5864","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-24T22:29:40Z","cross_cats_sorted":[],"title_canon_sha256":"419208407b0d2d4b0077147ccf22c0eac0c8837557ae91bb2c5c2906d148238c","abstract_canon_sha256":"1567e6023c10b4ebba6e0bf5ea4a07d682a987b3dceacf9804a200fcb430173a"},"schema_version":"1.0"},"canonical_sha256":"81021afee775726a54da7d765465645f76ba7eb492d46a733f2270075a0da752","source":{"kind":"arxiv","id":"1111.5864","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5864","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5864v3","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5864","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"QEBBV7XHOVZG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QEBBV7XHOVZGUVG2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QEBBV7XH","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QEBBV7XHOVZGUVG2PV3FIZLEL5","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5864","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-24T22:29:40Z","cross_cats_sorted":[],"title_canon_sha256":"419208407b0d2d4b0077147ccf22c0eac0c8837557ae91bb2c5c2906d148238c","abstract_canon_sha256":"1567e6023c10b4ebba6e0bf5ea4a07d682a987b3dceacf9804a200fcb430173a"},"schema_version":"1.0"},"canonical_sha256":"81021afee775726a54da7d765465645f76ba7eb492d46a733f2270075a0da752","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:55.345242Z","signature_b64":"UcJNMxhqNq7GwqHSEN0IzqJ4/RhXaCx/fS9hVGZ1c55AjMCLNBsEGRXbCRbQvQqpdUirhTSh3bGF0otmH6IGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81021afee775726a54da7d765465645f76ba7eb492d46a733f2270075a0da752","last_reissued_at":"2026-05-18T03:03:55.344599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:55.344599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5864","source_version":3,"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-18T03:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A61CjRHedodj1BNSxANCwx6cS5oXgu1VjqF99Rhh361n+kd09tgLe27Oh1g9DpYc4mb2mq0BNrR+XCMcALpABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:40:37.959026Z"},"content_sha256":"f213f63399c273a7c6a6cf92ad273f54c928884c05a646f24f1f675b2e947367","schema_version":"1.0","event_id":"sha256:f213f63399c273a7c6a6cf92ad273f54c928884c05a646f24f1f675b2e947367"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QEBBV7XHOVZGUVG2PV3FIZLEL5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Metric Dimension of Functigraphs","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":"2011-11-24T22:29:40Z","abstract_excerpt":"The \\emph{metric dimension} of a graph $G$, denoted by $\\dim(G)$, is the minimum number of vertices such that each vertex is uniquely determined by its distances to the chosen vertices. Let $G_1$ and $G_2$ be disjoint copies of a graph $G$ and let $f: V(G_1) \\rightarrow V(G_2)$ be a function. Then a \\emph{functigraph} $C(G, f)=(V, E)$ has the vertex set $V=V(G_1) \\cup V(G_2)$ and the edge set $E=E(G_1) \\cup E(G_2) \\cup \\{uv \\mid v=f(u)\\}$. We study how metric dimension behaves in passing from $G$ to $C(G,f)$ by first showing that $2 \\le \\dim(C(G, f)) \\le 2n-3$, if $G$ is a connected graph of o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5864","kind":"arxiv","version":3},"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-18T03:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xnn65pVR8d1hwKAbZepboOPul7xQBhXobw0s9hyA407D92qdgoWYJnyM/cnPIIUqXsxwF8neUp4qXBuCgTrNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:40:37.959797Z"},"content_sha256":"e4a90b12ff8873b85dd2db22a7cbd2baef46efe93930f29c533347f78b1cdb90","schema_version":"1.0","event_id":"sha256:e4a90b12ff8873b85dd2db22a7cbd2baef46efe93930f29c533347f78b1cdb90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEBBV7XHOVZGUVG2PV3FIZLEL5/bundle.json","state_url":"https://pith.science/pith/QEBBV7XHOVZGUVG2PV3FIZLEL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEBBV7XHOVZGUVG2PV3FIZLEL5/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-07T15:40:37Z","links":{"resolver":"https://pith.science/pith/QEBBV7XHOVZGUVG2PV3FIZLEL5","bundle":"https://pith.science/pith/QEBBV7XHOVZGUVG2PV3FIZLEL5/bundle.json","state":"https://pith.science/pith/QEBBV7XHOVZGUVG2PV3FIZLEL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEBBV7XHOVZGUVG2PV3FIZLEL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QEBBV7XHOVZGUVG2PV3FIZLEL5","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":"1567e6023c10b4ebba6e0bf5ea4a07d682a987b3dceacf9804a200fcb430173a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-24T22:29:40Z","title_canon_sha256":"419208407b0d2d4b0077147ccf22c0eac0c8837557ae91bb2c5c2906d148238c"},"schema_version":"1.0","source":{"id":"1111.5864","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5864","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5864v3","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5864","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"QEBBV7XHOVZG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QEBBV7XHOVZGUVG2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QEBBV7XH","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:e4a90b12ff8873b85dd2db22a7cbd2baef46efe93930f29c533347f78b1cdb90","target":"graph","created_at":"2026-05-18T03:03:55Z","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":"The \\emph{metric dimension} of a graph $G$, denoted by $\\dim(G)$, is the minimum number of vertices such that each vertex is uniquely determined by its distances to the chosen vertices. Let $G_1$ and $G_2$ be disjoint copies of a graph $G$ and let $f: V(G_1) \\rightarrow V(G_2)$ be a function. Then a \\emph{functigraph} $C(G, f)=(V, E)$ has the vertex set $V=V(G_1) \\cup V(G_2)$ and the edge set $E=E(G_1) \\cup E(G_2) \\cup \\{uv \\mid v=f(u)\\}$. We study how metric dimension behaves in passing from $G$ to $C(G,f)$ by first showing that $2 \\le \\dim(C(G, f)) \\le 2n-3$, if $G$ is a connected graph of o","authors_text":"Cong X. Kang, Eunjeong Yi, Linda Eroh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-24T22:29:40Z","title":"On Metric Dimension of Functigraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5864","kind":"arxiv","version":3},"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:f213f63399c273a7c6a6cf92ad273f54c928884c05a646f24f1f675b2e947367","target":"record","created_at":"2026-05-18T03:03:55Z","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":"1567e6023c10b4ebba6e0bf5ea4a07d682a987b3dceacf9804a200fcb430173a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-24T22:29:40Z","title_canon_sha256":"419208407b0d2d4b0077147ccf22c0eac0c8837557ae91bb2c5c2906d148238c"},"schema_version":"1.0","source":{"id":"1111.5864","kind":"arxiv","version":3}},"canonical_sha256":"81021afee775726a54da7d765465645f76ba7eb492d46a733f2270075a0da752","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81021afee775726a54da7d765465645f76ba7eb492d46a733f2270075a0da752","first_computed_at":"2026-05-18T03:03:55.344599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:55.344599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UcJNMxhqNq7GwqHSEN0IzqJ4/RhXaCx/fS9hVGZ1c55AjMCLNBsEGRXbCRbQvQqpdUirhTSh3bGF0otmH6IGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:55.345242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5864","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f213f63399c273a7c6a6cf92ad273f54c928884c05a646f24f1f675b2e947367","sha256:e4a90b12ff8873b85dd2db22a7cbd2baef46efe93930f29c533347f78b1cdb90"],"state_sha256":"c5eb34efe8d2c0cd71734e3f36f0494adf85c44e9648c584f6ad2f6bfdd6c354"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IjwkaoXVh6I3LJ1ZxECUVnClw6sP3r863GYQ5eb7KzdLdSZcHf5awBuXNRUnWYqS7qmBL4vQEH3VvT7xcHYPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:40:37.963145Z","bundle_sha256":"56ed44fcb6138c22c752c3ded3bd3eef1d920a9f69fbe80597485f81fe62b4d9"}}