{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VJ4GNWBQUCHNPQHZOENTSCPD3Q","short_pith_number":"pith:VJ4GNWBQ","canonical_record":{"source":{"id":"1501.04647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-19T21:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"6d86a4b3db9fee80e4010d0dd027ad8c1d91139c7722f1657cddc946e336ff0e","abstract_canon_sha256":"b3dfd94efa5c12816a0c606035480f33696c5b8b38a0bdc0a5ba2c8131128e37"},"schema_version":"1.0"},"canonical_sha256":"aa7866d830a08ed7c0f9711b3909e3dc37d9f09a96e3783cbf34772966b4ed7e","source":{"kind":"arxiv","id":"1501.04647","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04647","created_at":"2026-05-18T01:29:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04647v2","created_at":"2026-05-18T01:29:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04647","created_at":"2026-05-18T01:29:46Z"},{"alias_kind":"pith_short_12","alias_value":"VJ4GNWBQUCHN","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VJ4GNWBQUCHNPQHZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VJ4GNWBQ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VJ4GNWBQUCHNPQHZOENTSCPD3Q","target":"record","payload":{"canonical_record":{"source":{"id":"1501.04647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-19T21:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"6d86a4b3db9fee80e4010d0dd027ad8c1d91139c7722f1657cddc946e336ff0e","abstract_canon_sha256":"b3dfd94efa5c12816a0c606035480f33696c5b8b38a0bdc0a5ba2c8131128e37"},"schema_version":"1.0"},"canonical_sha256":"aa7866d830a08ed7c0f9711b3909e3dc37d9f09a96e3783cbf34772966b4ed7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:46.598504Z","signature_b64":"my+DXgG/a+G2h9guW2MCXJBI2DkXUDER6MbIZOXb40f3BCDQ//yTd80uxN+F8Hxjj+v70bpj7/yjj4G6B35BBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa7866d830a08ed7c0f9711b3909e3dc37d9f09a96e3783cbf34772966b4ed7e","last_reissued_at":"2026-05-18T01:29:46.597919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:46.597919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.04647","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:29:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LMFVgTM0XM1/T9TxKXSQhV6yakbtun0/wEhm/IhQMBlt0vhrKvpyRGol16mRnEgvaMCDv4DvDlQS6p70eZ5WDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:36.733235Z"},"content_sha256":"e3d667f0704a54a292705528b90eca8399d0b92364dab4f89bf4b907f3f950d6","schema_version":"1.0","event_id":"sha256:e3d667f0704a54a292705528b90eca8399d0b92364dab4f89bf4b907f3f950d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VJ4GNWBQUCHNPQHZOENTSCPD3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the adjacency dimension of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Estrada-Moreno, J. A. Rodriguez-Velazquez, Y. Ramirez-Cruz","submitted_at":"2015-01-19T21:22:50Z","abstract_excerpt":"A generator of a metric space is a set $S$ of points in the space with the property that every point of the space is uniquely determined by its distances from the elements of $S$. Given a simple graph $G=(V,E)$, we define the distance function $d_{G,2}:V\\times V\\rightarrow \\mathbb{N}\\cup \\{0\\}$, as $d_{G,2}(x,y)=\\min\\{d_G(x,y),2\\},$ where $d_G(x,y)$ is the length of a shortest path between $x$ and $y$ and $\\mathbb{N}$ is the set of positive integers. Then $(V,d_{G,2 })$ is a metric space. We say that a set $S\\subseteq V$ is a $k$-adjacency generator for $G$ if for every two vertices $x,y\\in V$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04647","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:29:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5v8CXAi36M4wqsol/x8Z00j/+Qngzy0cYBoucV7I1NKkyZUEv6vweb4AqdKH/56sStl/jSh+V7KNDId72ptLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:36.733595Z"},"content_sha256":"c58fc4e1d5c9b407ddecb1ea6a63b184c946f8892a66e19761ff0267fae84dbc","schema_version":"1.0","event_id":"sha256:c58fc4e1d5c9b407ddecb1ea6a63b184c946f8892a66e19761ff0267fae84dbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJ4GNWBQUCHNPQHZOENTSCPD3Q/bundle.json","state_url":"https://pith.science/pith/VJ4GNWBQUCHNPQHZOENTSCPD3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJ4GNWBQUCHNPQHZOENTSCPD3Q/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-05-31T20:09:36Z","links":{"resolver":"https://pith.science/pith/VJ4GNWBQUCHNPQHZOENTSCPD3Q","bundle":"https://pith.science/pith/VJ4GNWBQUCHNPQHZOENTSCPD3Q/bundle.json","state":"https://pith.science/pith/VJ4GNWBQUCHNPQHZOENTSCPD3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJ4GNWBQUCHNPQHZOENTSCPD3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VJ4GNWBQUCHNPQHZOENTSCPD3Q","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":"b3dfd94efa5c12816a0c606035480f33696c5b8b38a0bdc0a5ba2c8131128e37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-19T21:22:50Z","title_canon_sha256":"6d86a4b3db9fee80e4010d0dd027ad8c1d91139c7722f1657cddc946e336ff0e"},"schema_version":"1.0","source":{"id":"1501.04647","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04647","created_at":"2026-05-18T01:29:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04647v2","created_at":"2026-05-18T01:29:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04647","created_at":"2026-05-18T01:29:46Z"},{"alias_kind":"pith_short_12","alias_value":"VJ4GNWBQUCHN","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VJ4GNWBQUCHNPQHZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VJ4GNWBQ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:c58fc4e1d5c9b407ddecb1ea6a63b184c946f8892a66e19761ff0267fae84dbc","target":"graph","created_at":"2026-05-18T01:29:46Z","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 generator of a metric space is a set $S$ of points in the space with the property that every point of the space is uniquely determined by its distances from the elements of $S$. Given a simple graph $G=(V,E)$, we define the distance function $d_{G,2}:V\\times V\\rightarrow \\mathbb{N}\\cup \\{0\\}$, as $d_{G,2}(x,y)=\\min\\{d_G(x,y),2\\},$ where $d_G(x,y)$ is the length of a shortest path between $x$ and $y$ and $\\mathbb{N}$ is the set of positive integers. Then $(V,d_{G,2 })$ is a metric space. We say that a set $S\\subseteq V$ is a $k$-adjacency generator for $G$ if for every two vertices $x,y\\in V$","authors_text":"A. Estrada-Moreno, J. A. Rodriguez-Velazquez, Y. Ramirez-Cruz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-19T21:22:50Z","title":"On the adjacency dimension of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04647","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:e3d667f0704a54a292705528b90eca8399d0b92364dab4f89bf4b907f3f950d6","target":"record","created_at":"2026-05-18T01:29:46Z","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":"b3dfd94efa5c12816a0c606035480f33696c5b8b38a0bdc0a5ba2c8131128e37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-19T21:22:50Z","title_canon_sha256":"6d86a4b3db9fee80e4010d0dd027ad8c1d91139c7722f1657cddc946e336ff0e"},"schema_version":"1.0","source":{"id":"1501.04647","kind":"arxiv","version":2}},"canonical_sha256":"aa7866d830a08ed7c0f9711b3909e3dc37d9f09a96e3783cbf34772966b4ed7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa7866d830a08ed7c0f9711b3909e3dc37d9f09a96e3783cbf34772966b4ed7e","first_computed_at":"2026-05-18T01:29:46.597919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:46.597919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"my+DXgG/a+G2h9guW2MCXJBI2DkXUDER6MbIZOXb40f3BCDQ//yTd80uxN+F8Hxjj+v70bpj7/yjj4G6B35BBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:46.598504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04647","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3d667f0704a54a292705528b90eca8399d0b92364dab4f89bf4b907f3f950d6","sha256:c58fc4e1d5c9b407ddecb1ea6a63b184c946f8892a66e19761ff0267fae84dbc"],"state_sha256":"2ce0b5ee5fa0e7b34e3228fb5ff4b00b784f032f193af0e1793cf6a5d23ac775"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/HMlfhfY4BKWmre6L2JmeZcl5Xmol4h7GhbFO6NoX0qcDdu4agcJdZzbmhbrlZqOJ9DVsDwH/VysKJas3BtMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:09:36.735850Z","bundle_sha256":"8cf2b0eb14e7ffc570a03b2b88e98351bb56702022d1619d84a2e60c0770957f"}}