{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:JRBT7U4NMBEBV4YL72XCFEZ2O2","short_pith_number":"pith:JRBT7U4N","canonical_record":{"source":{"id":"2101.02838","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-01-08T03:57:55Z","cross_cats_sorted":[],"title_canon_sha256":"ef57a0639d6cf29b7097a7aefdb54d654e95dcfd3eab8bcae09eaef36c22a63a","abstract_canon_sha256":"66f5d225294f228b438ea01236f77fb52a18f248e78ac04093c0e10787a457b3"},"schema_version":"1.0"},"canonical_sha256":"4c433fd38d60481af30bfeae22933a76af7075ebf9debb1575f64c17212d2cd6","source":{"kind":"arxiv","id":"2101.02838","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.02838","created_at":"2026-07-05T02:05:30Z"},{"alias_kind":"arxiv_version","alias_value":"2101.02838v1","created_at":"2026-07-05T02:05:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.02838","created_at":"2026-07-05T02:05:30Z"},{"alias_kind":"pith_short_12","alias_value":"JRBT7U4NMBEB","created_at":"2026-07-05T02:05:30Z"},{"alias_kind":"pith_short_16","alias_value":"JRBT7U4NMBEBV4YL","created_at":"2026-07-05T02:05:30Z"},{"alias_kind":"pith_short_8","alias_value":"JRBT7U4N","created_at":"2026-07-05T02:05:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:JRBT7U4NMBEBV4YL72XCFEZ2O2","target":"record","payload":{"canonical_record":{"source":{"id":"2101.02838","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-01-08T03:57:55Z","cross_cats_sorted":[],"title_canon_sha256":"ef57a0639d6cf29b7097a7aefdb54d654e95dcfd3eab8bcae09eaef36c22a63a","abstract_canon_sha256":"66f5d225294f228b438ea01236f77fb52a18f248e78ac04093c0e10787a457b3"},"schema_version":"1.0"},"canonical_sha256":"4c433fd38d60481af30bfeae22933a76af7075ebf9debb1575f64c17212d2cd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:05:30.935781Z","signature_b64":"kXeKskF1oV+GuiIK9FdDH0eBs/ljFPsL6N2n9RrwcT2qV28ekqvnm7Ulks7GjrrhugKIXx5YU+jQzRjPZcE4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c433fd38d60481af30bfeae22933a76af7075ebf9debb1575f64c17212d2cd6","last_reissued_at":"2026-07-05T02:05:30.935439Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:05:30.935439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.02838","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-07-05T02:05:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYV9r+bMHv6Ry0a//0MVoBs5ilqkLgzYS1QA6yUEaRihdhsicak286kA11Lb/KKO6aWr9YGe5RbrBnKEfkvAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:48:07.711108Z"},"content_sha256":"d71901a7b81a1bbff2c6737b12c7d42c6d3c360a8fa8724562622bda05f9352c","schema_version":"1.0","event_id":"sha256:d71901a7b81a1bbff2c6737b12c7d42c6d3c360a8fa8724562622bda05f9352c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:JRBT7U4NMBEBV4YL72XCFEZ2O2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Completeness-resolvable graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huiling Xu, Min Feng, Xuanlong Ma","submitted_at":"2021-01-08T03:57:55Z","abstract_excerpt":"Given a connected graph $G=(V(G), E(G))$, the length of a shortest path from a vertex $u$ to a vertex $v$ is denoted by $d(u,v)$. For a proper subset $W$ of $V(G)$, let $m(W)$ be the maximum value of $d(u,v)$ as $u$ ranging over $W$ and $v$ ranging over $V(G)\\setminus W$. The proper subset $W=\\{w_1,\\ldots,w_{|W|}\\}$ is a {\\em completeness-resolving set} of $G$ if\n  $$\n  \\Psi_W: V(G)\\setminus W \\longrightarrow [m(W)]^{|W|},\\qquad u\\longmapsto (d(w_1,u),\\ldots,d(w_{|W|},u))\n  $$ is a bijection, where\n  $$\n  [m(W)]^{|W|}=\\{(a_{(1)},\\ldots,a_{(|W|)})\\mid 1\\leq a_{(i)}\\leq m(W)\\text{ for each }i=1,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.02838","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.02838/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:05:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qOj25V1lRKAS5NxHZaUsEde+yOHSUkhbiLWwHrfIH9BM2/UT1YYcMlAjiHY3/8qTw6SBslYA72GB6f8jaQZZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:48:07.711726Z"},"content_sha256":"91e28ec03ca7ae4500a73a42a5b50234f082b4ddf2efafebb99ab36c27708148","schema_version":"1.0","event_id":"sha256:91e28ec03ca7ae4500a73a42a5b50234f082b4ddf2efafebb99ab36c27708148"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRBT7U4NMBEBV4YL72XCFEZ2O2/bundle.json","state_url":"https://pith.science/pith/JRBT7U4NMBEBV4YL72XCFEZ2O2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRBT7U4NMBEBV4YL72XCFEZ2O2/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-07-09T03:48:07Z","links":{"resolver":"https://pith.science/pith/JRBT7U4NMBEBV4YL72XCFEZ2O2","bundle":"https://pith.science/pith/JRBT7U4NMBEBV4YL72XCFEZ2O2/bundle.json","state":"https://pith.science/pith/JRBT7U4NMBEBV4YL72XCFEZ2O2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRBT7U4NMBEBV4YL72XCFEZ2O2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:JRBT7U4NMBEBV4YL72XCFEZ2O2","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":"66f5d225294f228b438ea01236f77fb52a18f248e78ac04093c0e10787a457b3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-01-08T03:57:55Z","title_canon_sha256":"ef57a0639d6cf29b7097a7aefdb54d654e95dcfd3eab8bcae09eaef36c22a63a"},"schema_version":"1.0","source":{"id":"2101.02838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.02838","created_at":"2026-07-05T02:05:30Z"},{"alias_kind":"arxiv_version","alias_value":"2101.02838v1","created_at":"2026-07-05T02:05:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.02838","created_at":"2026-07-05T02:05:30Z"},{"alias_kind":"pith_short_12","alias_value":"JRBT7U4NMBEB","created_at":"2026-07-05T02:05:30Z"},{"alias_kind":"pith_short_16","alias_value":"JRBT7U4NMBEBV4YL","created_at":"2026-07-05T02:05:30Z"},{"alias_kind":"pith_short_8","alias_value":"JRBT7U4N","created_at":"2026-07-05T02:05:30Z"}],"graph_snapshots":[{"event_id":"sha256:91e28ec03ca7ae4500a73a42a5b50234f082b4ddf2efafebb99ab36c27708148","target":"graph","created_at":"2026-07-05T02:05:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.02838/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a connected graph $G=(V(G), E(G))$, the length of a shortest path from a vertex $u$ to a vertex $v$ is denoted by $d(u,v)$. For a proper subset $W$ of $V(G)$, let $m(W)$ be the maximum value of $d(u,v)$ as $u$ ranging over $W$ and $v$ ranging over $V(G)\\setminus W$. The proper subset $W=\\{w_1,\\ldots,w_{|W|}\\}$ is a {\\em completeness-resolving set} of $G$ if\n  $$\n  \\Psi_W: V(G)\\setminus W \\longrightarrow [m(W)]^{|W|},\\qquad u\\longmapsto (d(w_1,u),\\ldots,d(w_{|W|},u))\n  $$ is a bijection, where\n  $$\n  [m(W)]^{|W|}=\\{(a_{(1)},\\ldots,a_{(|W|)})\\mid 1\\leq a_{(i)}\\leq m(W)\\text{ for each }i=1,","authors_text":"Huiling Xu, Min Feng, Xuanlong Ma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-01-08T03:57:55Z","title":"Completeness-resolvable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.02838","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:d71901a7b81a1bbff2c6737b12c7d42c6d3c360a8fa8724562622bda05f9352c","target":"record","created_at":"2026-07-05T02:05:30Z","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":"66f5d225294f228b438ea01236f77fb52a18f248e78ac04093c0e10787a457b3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-01-08T03:57:55Z","title_canon_sha256":"ef57a0639d6cf29b7097a7aefdb54d654e95dcfd3eab8bcae09eaef36c22a63a"},"schema_version":"1.0","source":{"id":"2101.02838","kind":"arxiv","version":1}},"canonical_sha256":"4c433fd38d60481af30bfeae22933a76af7075ebf9debb1575f64c17212d2cd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c433fd38d60481af30bfeae22933a76af7075ebf9debb1575f64c17212d2cd6","first_computed_at":"2026-07-05T02:05:30.935439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:05:30.935439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kXeKskF1oV+GuiIK9FdDH0eBs/ljFPsL6N2n9RrwcT2qV28ekqvnm7Ulks7GjrrhugKIXx5YU+jQzRjPZcE4Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:05:30.935781Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.02838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d71901a7b81a1bbff2c6737b12c7d42c6d3c360a8fa8724562622bda05f9352c","sha256:91e28ec03ca7ae4500a73a42a5b50234f082b4ddf2efafebb99ab36c27708148"],"state_sha256":"7e438ecf3d574b3d4b07b27bc9a17a25b7d5033d001602b85b1d786cc59fddc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afmZRE4OWp++q1jC8BK6YSOprWt3iak2X9Z32NSD83eZPO7FYIOTfcLCzbZuL+JUZ4kq5BFqXCMlieSXz0TzCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T03:48:07.714440Z","bundle_sha256":"42042f60c22d6a91dbbe75e836706d1ff6f709c92dd7bb715c5bd4ef851a2d60"}}