{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4GUAZI5Q5XWAM4ZGGXSLWL3AT7","short_pith_number":"pith:4GUAZI5Q","canonical_record":{"source":{"id":"1401.5164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T03:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"eaff6987f1e57dc3aa82220cd7cf98ccbfd83cbe43a8f7b75992eab8fe50e750","abstract_canon_sha256":"999b12dd3f839ae89ddcfeaf60443bdbe32599d27e2e4dca3737fb49a0ae145b"},"schema_version":"1.0"},"canonical_sha256":"e1a80ca3b0edec06732635e4bb2f609fdc1b1beed94ed1825f83c0039781bada","source":{"kind":"arxiv","id":"1401.5164","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5164","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5164v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5164","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"4GUAZI5Q5XWA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4GUAZI5Q5XWAM4ZG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4GUAZI5Q","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4GUAZI5Q5XWAM4ZGGXSLWL3AT7","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T03:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"eaff6987f1e57dc3aa82220cd7cf98ccbfd83cbe43a8f7b75992eab8fe50e750","abstract_canon_sha256":"999b12dd3f839ae89ddcfeaf60443bdbe32599d27e2e4dca3737fb49a0ae145b"},"schema_version":"1.0"},"canonical_sha256":"e1a80ca3b0edec06732635e4bb2f609fdc1b1beed94ed1825f83c0039781bada","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:34.685205Z","signature_b64":"GuqGdne47s+bUaNex8O8ZoRpsD0CrHNcmUuVelnmAT/uJf+lrR9IbwuEBcMUnfphMJY+JbWEGrC5IBAPWrJFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1a80ca3b0edec06732635e4bb2f609fdc1b1beed94ed1825f83c0039781bada","last_reissued_at":"2026-05-18T03:01:34.684376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:34.684376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5164","source_version":1,"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:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrpJJ48f9KF3Y/8AePx4Sy36VVKuzMBn9lgZl23HkXlEBO6o9P/Li7GBZeAr6ywFGMeK0JFUkSefGwI5F6rfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:35:11.552325Z"},"content_sha256":"7db91945d2d7e31787945d59371697fa37214e427cd4603b593f7a1708f5305e","schema_version":"1.0","event_id":"sha256:7db91945d2d7e31787945d59371697fa37214e427cd4603b593f7a1708f5305e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4GUAZI5Q5XWAM4ZGGXSLWL3AT7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Metric Dimension of Amalgamation of Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danang Tri Murdiansyah, Rinovia Simanjuntak","submitted_at":"2014-01-21T03:22:36Z","abstract_excerpt":"A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$.\n  Let $\\{G_1, G_2, \\ldots, G_n\\}$ be a finite collection of graphs and each $G_i$ has a fixed vertex $v_{0_i}$ or a fixed edge $e_{0_i}$ called a terminal vertex or edge, respectively. The vertex-amalgamation of $G_1, G_2, \\ldots, G_n$, denoted by $Vertex-Amal\\{G_i;v_{0_i}\\}$, is formed by taking all the $G_i$'s and identifying their terminal vertices. Similarly, the edge-amalgamati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5164","kind":"arxiv","version":1},"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:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZL5oa28aqnxpal4ErRvlFo8TwJLE1przFn9BSTRVaY6N/YOZbqK+366yhx6I5NEbA2aD0W7EyH1WiVwoAH5LDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:35:11.552672Z"},"content_sha256":"6730199114f30c50457cb6ea83599b4467f53f105c7e75aacddfc8415e218981","schema_version":"1.0","event_id":"sha256:6730199114f30c50457cb6ea83599b4467f53f105c7e75aacddfc8415e218981"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GUAZI5Q5XWAM4ZGGXSLWL3AT7/bundle.json","state_url":"https://pith.science/pith/4GUAZI5Q5XWAM4ZGGXSLWL3AT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GUAZI5Q5XWAM4ZGGXSLWL3AT7/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-02T02:35:11Z","links":{"resolver":"https://pith.science/pith/4GUAZI5Q5XWAM4ZGGXSLWL3AT7","bundle":"https://pith.science/pith/4GUAZI5Q5XWAM4ZGGXSLWL3AT7/bundle.json","state":"https://pith.science/pith/4GUAZI5Q5XWAM4ZGGXSLWL3AT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GUAZI5Q5XWAM4ZGGXSLWL3AT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4GUAZI5Q5XWAM4ZGGXSLWL3AT7","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":"999b12dd3f839ae89ddcfeaf60443bdbe32599d27e2e4dca3737fb49a0ae145b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T03:22:36Z","title_canon_sha256":"eaff6987f1e57dc3aa82220cd7cf98ccbfd83cbe43a8f7b75992eab8fe50e750"},"schema_version":"1.0","source":{"id":"1401.5164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5164","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5164v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5164","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"4GUAZI5Q5XWA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4GUAZI5Q5XWAM4ZG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4GUAZI5Q","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:6730199114f30c50457cb6ea83599b4467f53f105c7e75aacddfc8415e218981","target":"graph","created_at":"2026-05-18T03:01:34Z","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":"A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$.\n  Let $\\{G_1, G_2, \\ldots, G_n\\}$ be a finite collection of graphs and each $G_i$ has a fixed vertex $v_{0_i}$ or a fixed edge $e_{0_i}$ called a terminal vertex or edge, respectively. The vertex-amalgamation of $G_1, G_2, \\ldots, G_n$, denoted by $Vertex-Amal\\{G_i;v_{0_i}\\}$, is formed by taking all the $G_i$'s and identifying their terminal vertices. Similarly, the edge-amalgamati","authors_text":"Danang Tri Murdiansyah, Rinovia Simanjuntak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T03:22:36Z","title":"Metric Dimension of Amalgamation of Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5164","kind":"arxiv","version":1},"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:7db91945d2d7e31787945d59371697fa37214e427cd4603b593f7a1708f5305e","target":"record","created_at":"2026-05-18T03:01:34Z","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":"999b12dd3f839ae89ddcfeaf60443bdbe32599d27e2e4dca3737fb49a0ae145b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T03:22:36Z","title_canon_sha256":"eaff6987f1e57dc3aa82220cd7cf98ccbfd83cbe43a8f7b75992eab8fe50e750"},"schema_version":"1.0","source":{"id":"1401.5164","kind":"arxiv","version":1}},"canonical_sha256":"e1a80ca3b0edec06732635e4bb2f609fdc1b1beed94ed1825f83c0039781bada","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1a80ca3b0edec06732635e4bb2f609fdc1b1beed94ed1825f83c0039781bada","first_computed_at":"2026-05-18T03:01:34.684376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:34.684376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GuqGdne47s+bUaNex8O8ZoRpsD0CrHNcmUuVelnmAT/uJf+lrR9IbwuEBcMUnfphMJY+JbWEGrC5IBAPWrJFDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:34.685205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7db91945d2d7e31787945d59371697fa37214e427cd4603b593f7a1708f5305e","sha256:6730199114f30c50457cb6ea83599b4467f53f105c7e75aacddfc8415e218981"],"state_sha256":"58a10daba425eec00ca6476e38f07304cf5ca64890a9540c90ccf0c4fd277c83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5YZFHUDvVqFTNTIZ8z+bodMDxJeaT4RPVmIn3y/jI9zvrE8qhvFehWzq2Kcb7HBXDSOUB8n0FEEyJ2N0ibADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:35:11.554577Z","bundle_sha256":"7fca23844306198acb6ccc1eee63617f48e2f318a9daf57aaa78cc05638dcebc"}}