{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:P2XYED6ZQOMC5NRXBUP4KSGIF6","short_pith_number":"pith:P2XYED6Z","canonical_record":{"source":{"id":"2303.12629","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-22T15:10:26Z","cross_cats_sorted":[],"title_canon_sha256":"f801e2ee10f82156178979d335b614716d7aacb13928ba8ea87c58969fc4d6e2","abstract_canon_sha256":"13c033caefb98ce9ff40df405fea36b51913c53f7585a8c0d1f9e2a199086990"},"schema_version":"1.0"},"canonical_sha256":"7eaf820fd983982eb6370d1fc548c82fa3e094b6e51ef8cfc55275a4759d7860","source":{"kind":"arxiv","id":"2303.12629","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.12629","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"2303.12629v3","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.12629","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"P2XYED6ZQOMC","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_16","alias_value":"P2XYED6ZQOMC5NRX","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_8","alias_value":"P2XYED6Z","created_at":"2026-07-05T05:58:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:P2XYED6ZQOMC5NRXBUP4KSGIF6","target":"record","payload":{"canonical_record":{"source":{"id":"2303.12629","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-22T15:10:26Z","cross_cats_sorted":[],"title_canon_sha256":"f801e2ee10f82156178979d335b614716d7aacb13928ba8ea87c58969fc4d6e2","abstract_canon_sha256":"13c033caefb98ce9ff40df405fea36b51913c53f7585a8c0d1f9e2a199086990"},"schema_version":"1.0"},"canonical_sha256":"7eaf820fd983982eb6370d1fc548c82fa3e094b6e51ef8cfc55275a4759d7860","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:20.223209Z","signature_b64":"HFML48LmtFkgupsYQC21NpyPSZSTOP8c9d/a8l2LhuxyO3GQL3+zXu8aLXN+ZIuaAmVree6WfwZ7JDO7acOTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7eaf820fd983982eb6370d1fc548c82fa3e094b6e51ef8cfc55275a4759d7860","last_reissued_at":"2026-07-05T05:58:20.222809Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:20.222809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.12629","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-07-05T05:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hi3Ry/Ss7bGtAAAmEloBu35SIADEIvD/f0uCveB2HPWGKyevRM8exWHmQ9mku+Z2bNoNna20cd9HE0Y1DTaEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:55:57.866229Z"},"content_sha256":"3eaa8e6ef43204cc4f98c6415d3814f79f962b7b386d3eb32cf9388bfec6c097","schema_version":"1.0","event_id":"sha256:3eaa8e6ef43204cc4f98c6415d3814f79f962b7b386d3eb32cf9388bfec6c097"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:P2XYED6ZQOMC5NRXBUP4KSGIF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new result similar to the Graham-Pollak theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zhi-Wei Sun","submitted_at":"2023-03-22T15:10:26Z","abstract_excerpt":"Let $n>1$ be an integer, and let $T$ be a tree with $n+1$ vertices $v_1,\\ldots,v_{n+1}$, where $v_1$ and $v_{n+1}$ are two leaves of $T$. For each edge $e$ of $T$, assign a complex number $w(e)$ as its weight. We obtain that $$\\det[x+d(v_{j+1},v_k)]_{1\\le j,k\\le n}=2^{n-2}\\prod_{e\\in E(T)}w(e),$$ where $d(v_{j+1},v_k)$ is the weighted distance between $v_{j+1}$ and $v_k$ in the tree $T$. This is similar to the celebrated Graham-Pollak theorem on determinants of distance matrices for trees. Actually, a more general result is deduced in this paper."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.12629","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.12629/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-05T05:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xb09C8tJ3jC+DiiNwAVpVjbG/iNhryMDzPsMBes0RC1MgX60bxjlKqGwuBlTb5vxqgpBPwqahPDNr3ngYNOZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:55:57.866890Z"},"content_sha256":"fb136dda8476ce2d1dd656757b70a7098d2bb0550bd41062c2abc21cdff4e346","schema_version":"1.0","event_id":"sha256:fb136dda8476ce2d1dd656757b70a7098d2bb0550bd41062c2abc21cdff4e346"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2XYED6ZQOMC5NRXBUP4KSGIF6/bundle.json","state_url":"https://pith.science/pith/P2XYED6ZQOMC5NRXBUP4KSGIF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2XYED6ZQOMC5NRXBUP4KSGIF6/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-03T20:55:57Z","links":{"resolver":"https://pith.science/pith/P2XYED6ZQOMC5NRXBUP4KSGIF6","bundle":"https://pith.science/pith/P2XYED6ZQOMC5NRXBUP4KSGIF6/bundle.json","state":"https://pith.science/pith/P2XYED6ZQOMC5NRXBUP4KSGIF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2XYED6ZQOMC5NRXBUP4KSGIF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:P2XYED6ZQOMC5NRXBUP4KSGIF6","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":"13c033caefb98ce9ff40df405fea36b51913c53f7585a8c0d1f9e2a199086990","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-22T15:10:26Z","title_canon_sha256":"f801e2ee10f82156178979d335b614716d7aacb13928ba8ea87c58969fc4d6e2"},"schema_version":"1.0","source":{"id":"2303.12629","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.12629","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"2303.12629v3","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.12629","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"P2XYED6ZQOMC","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_16","alias_value":"P2XYED6ZQOMC5NRX","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_8","alias_value":"P2XYED6Z","created_at":"2026-07-05T05:58:20Z"}],"graph_snapshots":[{"event_id":"sha256:fb136dda8476ce2d1dd656757b70a7098d2bb0550bd41062c2abc21cdff4e346","target":"graph","created_at":"2026-07-05T05:58:20Z","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/2303.12629/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $n>1$ be an integer, and let $T$ be a tree with $n+1$ vertices $v_1,\\ldots,v_{n+1}$, where $v_1$ and $v_{n+1}$ are two leaves of $T$. For each edge $e$ of $T$, assign a complex number $w(e)$ as its weight. We obtain that $$\\det[x+d(v_{j+1},v_k)]_{1\\le j,k\\le n}=2^{n-2}\\prod_{e\\in E(T)}w(e),$$ where $d(v_{j+1},v_k)$ is the weighted distance between $v_{j+1}$ and $v_k$ in the tree $T$. This is similar to the celebrated Graham-Pollak theorem on determinants of distance matrices for trees. Actually, a more general result is deduced in this paper.","authors_text":"Zhi-Wei Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-22T15:10:26Z","title":"A new result similar to the Graham-Pollak theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.12629","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:3eaa8e6ef43204cc4f98c6415d3814f79f962b7b386d3eb32cf9388bfec6c097","target":"record","created_at":"2026-07-05T05:58:20Z","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":"13c033caefb98ce9ff40df405fea36b51913c53f7585a8c0d1f9e2a199086990","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-22T15:10:26Z","title_canon_sha256":"f801e2ee10f82156178979d335b614716d7aacb13928ba8ea87c58969fc4d6e2"},"schema_version":"1.0","source":{"id":"2303.12629","kind":"arxiv","version":3}},"canonical_sha256":"7eaf820fd983982eb6370d1fc548c82fa3e094b6e51ef8cfc55275a4759d7860","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7eaf820fd983982eb6370d1fc548c82fa3e094b6e51ef8cfc55275a4759d7860","first_computed_at":"2026-07-05T05:58:20.222809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:58:20.222809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HFML48LmtFkgupsYQC21NpyPSZSTOP8c9d/a8l2LhuxyO3GQL3+zXu8aLXN+ZIuaAmVree6WfwZ7JDO7acOTBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:58:20.223209Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.12629","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eaa8e6ef43204cc4f98c6415d3814f79f962b7b386d3eb32cf9388bfec6c097","sha256:fb136dda8476ce2d1dd656757b70a7098d2bb0550bd41062c2abc21cdff4e346"],"state_sha256":"65ba01e289f4bb4a2ea60bec27951472cf71b1d6014df4e9cafbc4fb0077b5c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVf3l9xEBZNpKnidOr3NvQjMVLcIyyaT245L0D7fIHz3E9j8ufi9tw7Re1sU6FGeW/caVKx9yiil4XrwCngcAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:55:57.870720Z","bundle_sha256":"e285793aca6d916d9ddea63af237dac3c49a9cb7eedb8949e996df2dabe72eb0"}}