{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UUSYRKKL253FUGKBFEN5BKWSIP","short_pith_number":"pith:UUSYRKKL","canonical_record":{"source":{"id":"1607.00473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-02T07:32:11Z","cross_cats_sorted":[],"title_canon_sha256":"a49e21e285461394413bb4f833486288066d568b8caf0f4e5235cf8619808d49","abstract_canon_sha256":"d707fb73184d24d778da957ca832c06007861dbb0c88ac3c802c2e90c1fefc01"},"schema_version":"1.0"},"canonical_sha256":"a52588a94bd7765a1941291bd0aad243db7957bc99bfc539d5ca8e41e9c06f12","source":{"kind":"arxiv","id":"1607.00473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00473","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00473v1","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00473","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"pith_short_12","alias_value":"UUSYRKKL253F","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UUSYRKKL253FUGKB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UUSYRKKL","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UUSYRKKL253FUGKBFEN5BKWSIP","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-02T07:32:11Z","cross_cats_sorted":[],"title_canon_sha256":"a49e21e285461394413bb4f833486288066d568b8caf0f4e5235cf8619808d49","abstract_canon_sha256":"d707fb73184d24d778da957ca832c06007861dbb0c88ac3c802c2e90c1fefc01"},"schema_version":"1.0"},"canonical_sha256":"a52588a94bd7765a1941291bd0aad243db7957bc99bfc539d5ca8e41e9c06f12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:37.000467Z","signature_b64":"Y+xpY1UFgDFf0TBUgxu1YHWsl5Yi3nUzDxDf9h25l5GR2CRYfwJXY2GPhH2ZzhBxfkwJ8nEolPaqqHxUQFh/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a52588a94bd7765a1941291bd0aad243db7957bc99bfc539d5ca8e41e9c06f12","last_reissued_at":"2026-05-18T01:11:37.000103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:37.000103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00473","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-18T01:11:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtLAVfDya6ZuYJmwJnmojeJz9vJv/VFoBq6jMjmm2ZPIpmulPULXJc3TjTBe6F4U/SpDX5/6DykoqVQoMVtpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:59:07.322591Z"},"content_sha256":"16a3164b7c30397e113f7b5e082d0817f96a7e9ae9f6b2242cf92c0f918dfe97","schema_version":"1.0","event_id":"sha256:16a3164b7c30397e113f7b5e082d0817f96a7e9ae9f6b2242cf92c0f918dfe97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UUSYRKKL253FUGKBFEN5BKWSIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance and distance signless Laplacian spread of connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanglong Yu, Lihua You, Liyong Ren","submitted_at":"2016-07-02T07:32:11Z","abstract_excerpt":"For a connected graph $G$ on $n$ vertices, recall that the distance signless Laplacian matrix of $G$ is defined to be $\\mathcal{Q}(G)=Tr(G)+\\mathcal{D}(G)$, where $\\mathcal{D}(G)$ is the distance matrix, $Tr(G)=diag(D_1, D_2, \\ldots, D_n)$ and $D_{i}$ is the row sum of $\\mathcal{D}(G)$ corresponding to vertex $v_{i}$. Denote by $\\rho^{\\mathcal{D}}(G),$ $\\rho_{min}^{\\mathcal{D}}(G)$ the largest eigenvalue and the least eigenvalue of $\\mathcal{D}(G)$, respectively. And denote by $q^{\\mathcal{D}}(G)$, $q_{min}^{\\mathcal{D}}(G)$ the largest eigenvalue and the least eigenvalue of $\\mathcal{Q}(G)$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00473","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-18T01:11:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZYJNyVihxUAG4W2DHhDwafxo+Z5TpfEPj7aTn3Oc0Wz357tK8hKJu1XBc7t08RT7WBp/IxGwYUU0TXl70E5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:59:07.322937Z"},"content_sha256":"d27c2e52432d3e488e2e4e085d298e7f666e98c789808a4e7215ea2e9e749bd9","schema_version":"1.0","event_id":"sha256:d27c2e52432d3e488e2e4e085d298e7f666e98c789808a4e7215ea2e9e749bd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUSYRKKL253FUGKBFEN5BKWSIP/bundle.json","state_url":"https://pith.science/pith/UUSYRKKL253FUGKBFEN5BKWSIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUSYRKKL253FUGKBFEN5BKWSIP/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-06-01T22:59:07Z","links":{"resolver":"https://pith.science/pith/UUSYRKKL253FUGKBFEN5BKWSIP","bundle":"https://pith.science/pith/UUSYRKKL253FUGKBFEN5BKWSIP/bundle.json","state":"https://pith.science/pith/UUSYRKKL253FUGKBFEN5BKWSIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUSYRKKL253FUGKBFEN5BKWSIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UUSYRKKL253FUGKBFEN5BKWSIP","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":"d707fb73184d24d778da957ca832c06007861dbb0c88ac3c802c2e90c1fefc01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-02T07:32:11Z","title_canon_sha256":"a49e21e285461394413bb4f833486288066d568b8caf0f4e5235cf8619808d49"},"schema_version":"1.0","source":{"id":"1607.00473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00473","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00473v1","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00473","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"pith_short_12","alias_value":"UUSYRKKL253F","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UUSYRKKL253FUGKB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UUSYRKKL","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:d27c2e52432d3e488e2e4e085d298e7f666e98c789808a4e7215ea2e9e749bd9","target":"graph","created_at":"2026-05-18T01:11:37Z","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":"For a connected graph $G$ on $n$ vertices, recall that the distance signless Laplacian matrix of $G$ is defined to be $\\mathcal{Q}(G)=Tr(G)+\\mathcal{D}(G)$, where $\\mathcal{D}(G)$ is the distance matrix, $Tr(G)=diag(D_1, D_2, \\ldots, D_n)$ and $D_{i}$ is the row sum of $\\mathcal{D}(G)$ corresponding to vertex $v_{i}$. Denote by $\\rho^{\\mathcal{D}}(G),$ $\\rho_{min}^{\\mathcal{D}}(G)$ the largest eigenvalue and the least eigenvalue of $\\mathcal{D}(G)$, respectively. And denote by $q^{\\mathcal{D}}(G)$, $q_{min}^{\\mathcal{D}}(G)$ the largest eigenvalue and the least eigenvalue of $\\mathcal{Q}(G)$, ","authors_text":"Guanglong Yu, Lihua You, Liyong Ren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-02T07:32:11Z","title":"Distance and distance signless Laplacian spread of connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00473","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:16a3164b7c30397e113f7b5e082d0817f96a7e9ae9f6b2242cf92c0f918dfe97","target":"record","created_at":"2026-05-18T01:11:37Z","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":"d707fb73184d24d778da957ca832c06007861dbb0c88ac3c802c2e90c1fefc01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-02T07:32:11Z","title_canon_sha256":"a49e21e285461394413bb4f833486288066d568b8caf0f4e5235cf8619808d49"},"schema_version":"1.0","source":{"id":"1607.00473","kind":"arxiv","version":1}},"canonical_sha256":"a52588a94bd7765a1941291bd0aad243db7957bc99bfc539d5ca8e41e9c06f12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a52588a94bd7765a1941291bd0aad243db7957bc99bfc539d5ca8e41e9c06f12","first_computed_at":"2026-05-18T01:11:37.000103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:37.000103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y+xpY1UFgDFf0TBUgxu1YHWsl5Yi3nUzDxDf9h25l5GR2CRYfwJXY2GPhH2ZzhBxfkwJ8nEolPaqqHxUQFh/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:37.000467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16a3164b7c30397e113f7b5e082d0817f96a7e9ae9f6b2242cf92c0f918dfe97","sha256:d27c2e52432d3e488e2e4e085d298e7f666e98c789808a4e7215ea2e9e749bd9"],"state_sha256":"a60378fea05809232cc333c02ce200ab777e4e3a57f8e8ef46d2286fd93939b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCVpAn4AcCy+YsZOus/NRFT2dyuyRNB6EaVf/ho0Gya5ap5YC5kOvVMc73YNxUdZeQO4tBsRDsuhOEeiBnvqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:59:07.325041Z","bundle_sha256":"ebc5bed099bc244a4d3a8b131583e2a19190477e64a1f17b79e34dfa9a635f2d"}}