{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6LSYKTLF5X5UHRZP6WA5KSSNXY","short_pith_number":"pith:6LSYKTLF","canonical_record":{"source":{"id":"1907.02851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T00:49:25Z","cross_cats_sorted":[],"title_canon_sha256":"ae5aaeca45370497aa1a6fd947710f178e6eeb02977f6b8e35518135c8c5519d","abstract_canon_sha256":"fd5bba6c0de4784d0c941065946dff8a277a933ef0fd3f33f65a11895cf45a47"},"schema_version":"1.0"},"canonical_sha256":"f2e5854d65edfb43c72ff581d54a4dbe192a02def3018d518effdd527d4bb50c","source":{"kind":"arxiv","id":"1907.02851","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02851","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02851v1","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02851","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"pith_short_12","alias_value":"6LSYKTLF5X5U","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6LSYKTLF5X5UHRZP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6LSYKTLF","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6LSYKTLF5X5UHRZP6WA5KSSNXY","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T00:49:25Z","cross_cats_sorted":[],"title_canon_sha256":"ae5aaeca45370497aa1a6fd947710f178e6eeb02977f6b8e35518135c8c5519d","abstract_canon_sha256":"fd5bba6c0de4784d0c941065946dff8a277a933ef0fd3f33f65a11895cf45a47"},"schema_version":"1.0"},"canonical_sha256":"f2e5854d65edfb43c72ff581d54a4dbe192a02def3018d518effdd527d4bb50c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:22.864708Z","signature_b64":"TFw4j0YOKll0emd3TlB/1Z2RRx9eFp62/do94mTvqIACDXWrrYjcFLzt51zaZ9/uOURflY+YxYqMZSDWN7f4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2e5854d65edfb43c72ff581d54a4dbe192a02def3018d518effdd527d4bb50c","last_reissued_at":"2026-05-17T23:41:22.863918Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:22.863918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02851","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-17T23:41:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FDxSr2QRD5q046WczifmoG8Lc6L3KGkClvzCnHPrJpa2rV0akwo+hVkNtfbnVrKcXWizyjmB8ToL25R134DJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:26:03.763262Z"},"content_sha256":"9d40fbeb1bd810ee8a62b3c42e83c487d6313647bf4213ab2aef3eb9477c59c6","schema_version":"1.0","event_id":"sha256:9d40fbeb1bd810ee8a62b3c42e83c487d6313647bf4213ab2aef3eb9477c59c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6LSYKTLF5X5UHRZP6WA5KSSNXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some graft transformations and their applications on distance (signless) Laplacian spectra of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dandy Fan, Guoping Wang","submitted_at":"2019-07-04T00:49:25Z","abstract_excerpt":"Suppose that the vertex set of a connected graph $G$ is $V(G)=\\{v_1,\\cdots,v_n\\}$. Then we denote by $Tr_{G}(v_i)$ the sum of distances between $v_i$ and all other vertices of $G$. Let $Tr(G)$ be the $n\\times n$ diagonal matrix with its $(i,i)$-entry equal to $Tr_{G}(v_{i})$ and $D(G)$ be the distance matrix of $G$. Then $Q_{D}(G)=Tr(G)+D(G)$ and $L_{D}(G)=Tr(G)-D(G)$ are respectively the distance signless Laplacian matrix and distance Laplacian matrix of $G$. The largest eigenvalues $\\rho_{Q}(G)$ and $\\rho_{L}(G)$ of $Q_D(G)$ and $L_D(G)$ are respectively called distance signless Laplacian sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02851","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-17T23:41:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Su75F40eeoRm/MmtyCvNEtE+3YktqeUELRkBMimgxjvBpI1sYQSa4wsEaArgQ6kSOfLPAJKDnVAypk5ji3FuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:26:03.764024Z"},"content_sha256":"55ce41946e162f5df12e6538f571e237582099b40a62f9c90bcff50bd028497a","schema_version":"1.0","event_id":"sha256:55ce41946e162f5df12e6538f571e237582099b40a62f9c90bcff50bd028497a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LSYKTLF5X5UHRZP6WA5KSSNXY/bundle.json","state_url":"https://pith.science/pith/6LSYKTLF5X5UHRZP6WA5KSSNXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LSYKTLF5X5UHRZP6WA5KSSNXY/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-26T04:26:03Z","links":{"resolver":"https://pith.science/pith/6LSYKTLF5X5UHRZP6WA5KSSNXY","bundle":"https://pith.science/pith/6LSYKTLF5X5UHRZP6WA5KSSNXY/bundle.json","state":"https://pith.science/pith/6LSYKTLF5X5UHRZP6WA5KSSNXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LSYKTLF5X5UHRZP6WA5KSSNXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6LSYKTLF5X5UHRZP6WA5KSSNXY","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":"fd5bba6c0de4784d0c941065946dff8a277a933ef0fd3f33f65a11895cf45a47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T00:49:25Z","title_canon_sha256":"ae5aaeca45370497aa1a6fd947710f178e6eeb02977f6b8e35518135c8c5519d"},"schema_version":"1.0","source":{"id":"1907.02851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02851","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02851v1","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02851","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"pith_short_12","alias_value":"6LSYKTLF5X5U","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6LSYKTLF5X5UHRZP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6LSYKTLF","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:55ce41946e162f5df12e6538f571e237582099b40a62f9c90bcff50bd028497a","target":"graph","created_at":"2026-05-17T23:41:22Z","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":"Suppose that the vertex set of a connected graph $G$ is $V(G)=\\{v_1,\\cdots,v_n\\}$. Then we denote by $Tr_{G}(v_i)$ the sum of distances between $v_i$ and all other vertices of $G$. Let $Tr(G)$ be the $n\\times n$ diagonal matrix with its $(i,i)$-entry equal to $Tr_{G}(v_{i})$ and $D(G)$ be the distance matrix of $G$. Then $Q_{D}(G)=Tr(G)+D(G)$ and $L_{D}(G)=Tr(G)-D(G)$ are respectively the distance signless Laplacian matrix and distance Laplacian matrix of $G$. The largest eigenvalues $\\rho_{Q}(G)$ and $\\rho_{L}(G)$ of $Q_D(G)$ and $L_D(G)$ are respectively called distance signless Laplacian sp","authors_text":"Dandy Fan, Guoping Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T00:49:25Z","title":"Some graft transformations and their applications on distance (signless) Laplacian spectra of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02851","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:9d40fbeb1bd810ee8a62b3c42e83c487d6313647bf4213ab2aef3eb9477c59c6","target":"record","created_at":"2026-05-17T23:41:22Z","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":"fd5bba6c0de4784d0c941065946dff8a277a933ef0fd3f33f65a11895cf45a47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-04T00:49:25Z","title_canon_sha256":"ae5aaeca45370497aa1a6fd947710f178e6eeb02977f6b8e35518135c8c5519d"},"schema_version":"1.0","source":{"id":"1907.02851","kind":"arxiv","version":1}},"canonical_sha256":"f2e5854d65edfb43c72ff581d54a4dbe192a02def3018d518effdd527d4bb50c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2e5854d65edfb43c72ff581d54a4dbe192a02def3018d518effdd527d4bb50c","first_computed_at":"2026-05-17T23:41:22.863918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:22.863918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TFw4j0YOKll0emd3TlB/1Z2RRx9eFp62/do94mTvqIACDXWrrYjcFLzt51zaZ9/uOURflY+YxYqMZSDWN7f4CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:22.864708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d40fbeb1bd810ee8a62b3c42e83c487d6313647bf4213ab2aef3eb9477c59c6","sha256:55ce41946e162f5df12e6538f571e237582099b40a62f9c90bcff50bd028497a"],"state_sha256":"10e0c31c2791d8b4b987f9a28c191bb74f7b6f5653b18a9d60cd56e0d4d500b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBu0+Q4pymdJd8xsaHV18EK9jdci0Z85DBbE8U8bYUtku3LYZSl1Zbgum6JaljsLahou2jjBRzEdzTxw2Qr9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:26:03.767995Z","bundle_sha256":"2cc5d396d8c2435213b6ed325cbd1b43dfceb8c1f2830b8bb7729ecf9b9e760b"}}