{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:G3D7T2ND3NAUFHVQL4IETXCCUD","short_pith_number":"pith:G3D7T2ND","canonical_record":{"source":{"id":"2404.04039","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-05T11:49:28Z","cross_cats_sorted":[],"title_canon_sha256":"0ec145a503b6017bb9f47b8ee0d56b16a903d376ec9b39843a5c35ce6e2a01e4","abstract_canon_sha256":"1d1dd0ed9058952546c075ef430e24f2e8446db9c21395ae3712412152a223dd"},"schema_version":"1.0"},"canonical_sha256":"36c7f9e9a3db41429eb05f1049dc42a0d1b5bc71a1e02372139ae7036cf1dd69","source":{"kind":"arxiv","id":"2404.04039","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.04039","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"2404.04039v8","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.04039","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"G3D7T2ND3NAU","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"pith_short_16","alias_value":"G3D7T2ND3NAUFHVQ","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"pith_short_8","alias_value":"G3D7T2ND","created_at":"2026-07-05T09:54:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:G3D7T2ND3NAUFHVQL4IETXCCUD","target":"record","payload":{"canonical_record":{"source":{"id":"2404.04039","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-05T11:49:28Z","cross_cats_sorted":[],"title_canon_sha256":"0ec145a503b6017bb9f47b8ee0d56b16a903d376ec9b39843a5c35ce6e2a01e4","abstract_canon_sha256":"1d1dd0ed9058952546c075ef430e24f2e8446db9c21395ae3712412152a223dd"},"schema_version":"1.0"},"canonical_sha256":"36c7f9e9a3db41429eb05f1049dc42a0d1b5bc71a1e02372139ae7036cf1dd69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:26.003669Z","signature_b64":"lmRFlHgQP+aj/9fzOLy3PX54TGnQnWlzaBAKg1wLvwzghYjr1qjwzDbvL+boCOn77j76qKCqQkT+PrB3Wz8cCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36c7f9e9a3db41429eb05f1049dc42a0d1b5bc71a1e02372139ae7036cf1dd69","last_reissued_at":"2026-07-05T09:54:26.003237Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:26.003237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.04039","source_version":8,"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-05T09:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8OeXFG9rN75Eq0loCIx6CDPTaTjB4z0EDO3Qz1PRjtoQepZdywVojn7h6p2Nr4CE9OqP50lkeDz7dnjMd8PaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T00:02:17.410317Z"},"content_sha256":"7710179713c649c393762b2f1edd4a8576f88c405e422dfa60dbeb980cc10e6a","schema_version":"1.0","event_id":"sha256:7710179713c649c393762b2f1edd4a8576f88c405e422dfa60dbeb980cc10e6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:G3D7T2ND3NAUFHVQL4IETXCCUD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstructing a graph from the distance matrix of its boundary","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ignacio M. Pelayo, Jos\\'e C\\'aceres","submitted_at":"2024-04-05T11:49:28Z","abstract_excerpt":"A vertex $v$ of a connected graph $G$ is said to be a boundary vertex of $G$ if for some other vertex $u$ of $G$, no neighbor of $v$ is further away from $u$ than $v$. The boundary $\\partial(G)$ of $G$ is the set of all of its boundary vertices.\n  The boundary distance matrix $\\hat{D}_G$ of a graph $G=([n],E)$ is the square matrix of order $\\kappa$, being $\\kappa$ the order of $\\partial(G)$, such that for every $i,j\\in \\partial(G)$, $[\\hat{D}_G]_{ij}=d_G(i,j)$.\n  Given a square matrix $\\hat{B}$ of order $\\kappa$, we prove under which conditions $\\hat{B}$ is the distance matrix $\\hat{D}_T$ of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.04039","kind":"arxiv","version":8},"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/2404.04039/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-05T09:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2XSQjvUCk9Iy1D8i7XGNoi0LIOkpkTLCeHaO++KH/KbQiJq8LpE30uqP+yWIIVJRN+D3gbyt7LU3hObSY10Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T00:02:17.411154Z"},"content_sha256":"4655527d83144d0abb29aa7097bb76f5e297fe733833955c8294c385cc328f3c","schema_version":"1.0","event_id":"sha256:4655527d83144d0abb29aa7097bb76f5e297fe733833955c8294c385cc328f3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3D7T2ND3NAUFHVQL4IETXCCUD/bundle.json","state_url":"https://pith.science/pith/G3D7T2ND3NAUFHVQL4IETXCCUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3D7T2ND3NAUFHVQL4IETXCCUD/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-08-06T00:02:17Z","links":{"resolver":"https://pith.science/pith/G3D7T2ND3NAUFHVQL4IETXCCUD","bundle":"https://pith.science/pith/G3D7T2ND3NAUFHVQL4IETXCCUD/bundle.json","state":"https://pith.science/pith/G3D7T2ND3NAUFHVQL4IETXCCUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3D7T2ND3NAUFHVQL4IETXCCUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:G3D7T2ND3NAUFHVQL4IETXCCUD","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":"1d1dd0ed9058952546c075ef430e24f2e8446db9c21395ae3712412152a223dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-05T11:49:28Z","title_canon_sha256":"0ec145a503b6017bb9f47b8ee0d56b16a903d376ec9b39843a5c35ce6e2a01e4"},"schema_version":"1.0","source":{"id":"2404.04039","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.04039","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"2404.04039v8","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.04039","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"G3D7T2ND3NAU","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"pith_short_16","alias_value":"G3D7T2ND3NAUFHVQ","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"pith_short_8","alias_value":"G3D7T2ND","created_at":"2026-07-05T09:54:26Z"}],"graph_snapshots":[{"event_id":"sha256:4655527d83144d0abb29aa7097bb76f5e297fe733833955c8294c385cc328f3c","target":"graph","created_at":"2026-07-05T09:54:26Z","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/2404.04039/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A vertex $v$ of a connected graph $G$ is said to be a boundary vertex of $G$ if for some other vertex $u$ of $G$, no neighbor of $v$ is further away from $u$ than $v$. The boundary $\\partial(G)$ of $G$ is the set of all of its boundary vertices.\n  The boundary distance matrix $\\hat{D}_G$ of a graph $G=([n],E)$ is the square matrix of order $\\kappa$, being $\\kappa$ the order of $\\partial(G)$, such that for every $i,j\\in \\partial(G)$, $[\\hat{D}_G]_{ij}=d_G(i,j)$.\n  Given a square matrix $\\hat{B}$ of order $\\kappa$, we prove under which conditions $\\hat{B}$ is the distance matrix $\\hat{D}_T$ of t","authors_text":"Ignacio M. Pelayo, Jos\\'e C\\'aceres","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-05T11:49:28Z","title":"Reconstructing a graph from the distance matrix of its boundary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.04039","kind":"arxiv","version":8},"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:7710179713c649c393762b2f1edd4a8576f88c405e422dfa60dbeb980cc10e6a","target":"record","created_at":"2026-07-05T09:54:26Z","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":"1d1dd0ed9058952546c075ef430e24f2e8446db9c21395ae3712412152a223dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-05T11:49:28Z","title_canon_sha256":"0ec145a503b6017bb9f47b8ee0d56b16a903d376ec9b39843a5c35ce6e2a01e4"},"schema_version":"1.0","source":{"id":"2404.04039","kind":"arxiv","version":8}},"canonical_sha256":"36c7f9e9a3db41429eb05f1049dc42a0d1b5bc71a1e02372139ae7036cf1dd69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36c7f9e9a3db41429eb05f1049dc42a0d1b5bc71a1e02372139ae7036cf1dd69","first_computed_at":"2026-07-05T09:54:26.003237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:54:26.003237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lmRFlHgQP+aj/9fzOLy3PX54TGnQnWlzaBAKg1wLvwzghYjr1qjwzDbvL+boCOn77j76qKCqQkT+PrB3Wz8cCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:54:26.003669Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.04039","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7710179713c649c393762b2f1edd4a8576f88c405e422dfa60dbeb980cc10e6a","sha256:4655527d83144d0abb29aa7097bb76f5e297fe733833955c8294c385cc328f3c"],"state_sha256":"ec26807daea72f7e5e0c7f7c492664355cdde629b3c10453b7aee71d65d90402"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSrBb16+D0Fmn0m/wOEOijf7HZO+jOasFwQAlyHOMyZwpwQ7p86S/D3wfiJVVOFC3C/2gCk0Vjgqfo3jR5LoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T00:02:17.415616Z","bundle_sha256":"60d0791e271259dc45ba1de2345cc454b74c1a55a49e8068f73e89ee0933fb92"}}