{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IV2MJLP6VZWQIWAFF7O7RGPJPV","short_pith_number":"pith:IV2MJLP6","canonical_record":{"source":{"id":"1707.08685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-27T02:15:39Z","cross_cats_sorted":[],"title_canon_sha256":"1f9b4f20c742066fc45ad8441ab98e74e16a3dc3eebf0f1053c2f3d987826f2b","abstract_canon_sha256":"52ea1c48a2d5e60bb2a0f17c2f8473bfb45dd99ae312eecd1ed30b33b989a413"},"schema_version":"1.0"},"canonical_sha256":"4574c4adfeae6d0458052fddf899e97d601639538b09a73642dc8e4c28816e42","source":{"kind":"arxiv","id":"1707.08685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08685","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08685v1","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08685","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"IV2MJLP6VZWQ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IV2MJLP6VZWQIWAF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IV2MJLP6","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IV2MJLP6VZWQIWAFF7O7RGPJPV","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-27T02:15:39Z","cross_cats_sorted":[],"title_canon_sha256":"1f9b4f20c742066fc45ad8441ab98e74e16a3dc3eebf0f1053c2f3d987826f2b","abstract_canon_sha256":"52ea1c48a2d5e60bb2a0f17c2f8473bfb45dd99ae312eecd1ed30b33b989a413"},"schema_version":"1.0"},"canonical_sha256":"4574c4adfeae6d0458052fddf899e97d601639538b09a73642dc8e4c28816e42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:22.272307Z","signature_b64":"+dlDTBbpsHZJPFH5Wg9FnktsjTO3I326JN8yBntkDhRun7h8+iEAyNGy2FQPE4VeFhgp5OpgLyGCZKEnEPqhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4574c4adfeae6d0458052fddf899e97d601639538b09a73642dc8e4c28816e42","last_reissued_at":"2026-05-18T00:39:22.271573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:22.271573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08685","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-18T00:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OU74nm/ApyVde7XLkLwK3CfB9kvhsdSSZJLGASBGZZsWiHFXeTxGy64ym+3Kww9SyXZHMnFQ1LOomibhrvbKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:12:36.178842Z"},"content_sha256":"4f4ca331134ff4360af1468d0f44965c57266ac05fdef7d8b0433b7f474f58f4","schema_version":"1.0","event_id":"sha256:4f4ca331134ff4360af1468d0f44965c57266ac05fdef7d8b0433b7f474f58f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IV2MJLP6VZWQIWAFF7O7RGPJPV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The distance Laplacian spectral radius of unicyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Hongying Lin","submitted_at":"2017-07-27T02:15:39Z","abstract_excerpt":"For a connected graph $G$, the distance Laplacian spectral radius of $G$ is the spectral radius of its distance Laplacian matrix $\\mathcal{L}(G)$ defined as $\\mathcal{L}(G)=Tr(G)-D(G)$, where $Tr(G)$ is a diagonal matrix of vertex transmissions of $G$ and $D(G)$ is the distance matrix of $G$. In this paper, we determine the unique graphs with maximum distance Laplacian spectral radius among unicyclic graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08685","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-18T00:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pA/Gj8qYZD+ydpwgm+piQTb1KecFobht/D3J9hYybCdlquHzwpP/3A2+FB8CTsIvFtVoILWrtCsg7p5+GUWMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:12:36.179186Z"},"content_sha256":"887893974a888104f142d3b43e1bc7328b52f017985a242cba0e3dc71979415f","schema_version":"1.0","event_id":"sha256:887893974a888104f142d3b43e1bc7328b52f017985a242cba0e3dc71979415f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IV2MJLP6VZWQIWAFF7O7RGPJPV/bundle.json","state_url":"https://pith.science/pith/IV2MJLP6VZWQIWAFF7O7RGPJPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IV2MJLP6VZWQIWAFF7O7RGPJPV/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-30T20:12:36Z","links":{"resolver":"https://pith.science/pith/IV2MJLP6VZWQIWAFF7O7RGPJPV","bundle":"https://pith.science/pith/IV2MJLP6VZWQIWAFF7O7RGPJPV/bundle.json","state":"https://pith.science/pith/IV2MJLP6VZWQIWAFF7O7RGPJPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IV2MJLP6VZWQIWAFF7O7RGPJPV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IV2MJLP6VZWQIWAFF7O7RGPJPV","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":"52ea1c48a2d5e60bb2a0f17c2f8473bfb45dd99ae312eecd1ed30b33b989a413","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-27T02:15:39Z","title_canon_sha256":"1f9b4f20c742066fc45ad8441ab98e74e16a3dc3eebf0f1053c2f3d987826f2b"},"schema_version":"1.0","source":{"id":"1707.08685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08685","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08685v1","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08685","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"IV2MJLP6VZWQ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IV2MJLP6VZWQIWAF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IV2MJLP6","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:887893974a888104f142d3b43e1bc7328b52f017985a242cba0e3dc71979415f","target":"graph","created_at":"2026-05-18T00:39: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":"For a connected graph $G$, the distance Laplacian spectral radius of $G$ is the spectral radius of its distance Laplacian matrix $\\mathcal{L}(G)$ defined as $\\mathcal{L}(G)=Tr(G)-D(G)$, where $Tr(G)$ is a diagonal matrix of vertex transmissions of $G$ and $D(G)$ is the distance matrix of $G$. In this paper, we determine the unique graphs with maximum distance Laplacian spectral radius among unicyclic graphs.","authors_text":"Bo Zhou, Hongying Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-27T02:15:39Z","title":"The distance Laplacian spectral radius of unicyclic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08685","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:4f4ca331134ff4360af1468d0f44965c57266ac05fdef7d8b0433b7f474f58f4","target":"record","created_at":"2026-05-18T00:39: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":"52ea1c48a2d5e60bb2a0f17c2f8473bfb45dd99ae312eecd1ed30b33b989a413","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-27T02:15:39Z","title_canon_sha256":"1f9b4f20c742066fc45ad8441ab98e74e16a3dc3eebf0f1053c2f3d987826f2b"},"schema_version":"1.0","source":{"id":"1707.08685","kind":"arxiv","version":1}},"canonical_sha256":"4574c4adfeae6d0458052fddf899e97d601639538b09a73642dc8e4c28816e42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4574c4adfeae6d0458052fddf899e97d601639538b09a73642dc8e4c28816e42","first_computed_at":"2026-05-18T00:39:22.271573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:22.271573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+dlDTBbpsHZJPFH5Wg9FnktsjTO3I326JN8yBntkDhRun7h8+iEAyNGy2FQPE4VeFhgp5OpgLyGCZKEnEPqhDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:22.272307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f4ca331134ff4360af1468d0f44965c57266ac05fdef7d8b0433b7f474f58f4","sha256:887893974a888104f142d3b43e1bc7328b52f017985a242cba0e3dc71979415f"],"state_sha256":"c7c18cc60f1ec0450cb94439426ef88ba248ff0bcdb17762c4959368bcd0fa1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6f9XCKYljo4NtsJ2iIvHNS553YVW1ZyouINzFwdXXOk7+A5RKoqrb7tzVqz5VeWw0JPdywq1QUfFIXv1Mu5pAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T20:12:36.181266Z","bundle_sha256":"3707cc4e9f198bb38f806de5d212a14b991d7336b29cabbdf27024a4a955018c"}}