{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZYQE5JK4ES5IZ3SZQX2YOXOE72","short_pith_number":"pith:ZYQE5JK4","canonical_record":{"source":{"id":"1311.1987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-08T14:44:52Z","cross_cats_sorted":[],"title_canon_sha256":"5323d8372ce9ee9dba015da07fa0bd36254cd7aa39b37cf52ac9c51269598929","abstract_canon_sha256":"1e438cbc774403c33020981229a57c8a49e21b53ebc220df72098825fc3482ea"},"schema_version":"1.0"},"canonical_sha256":"ce204ea55c24ba8cee5985f5875dc4feb68cb1d37e33e281bd378c1150d1283a","source":{"kind":"arxiv","id":"1311.1987","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1987","created_at":"2026-05-18T03:07:41Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1987v1","created_at":"2026-05-18T03:07:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1987","created_at":"2026-05-18T03:07:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZYQE5JK4ES5I","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZYQE5JK4ES5IZ3SZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZYQE5JK4","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZYQE5JK4ES5IZ3SZQX2YOXOE72","target":"record","payload":{"canonical_record":{"source":{"id":"1311.1987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-08T14:44:52Z","cross_cats_sorted":[],"title_canon_sha256":"5323d8372ce9ee9dba015da07fa0bd36254cd7aa39b37cf52ac9c51269598929","abstract_canon_sha256":"1e438cbc774403c33020981229a57c8a49e21b53ebc220df72098825fc3482ea"},"schema_version":"1.0"},"canonical_sha256":"ce204ea55c24ba8cee5985f5875dc4feb68cb1d37e33e281bd378c1150d1283a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:41.812384Z","signature_b64":"C/T0cp37z8U8a2/tCcXXeMJVkbrPslp12TL3N07NQKxVJk/r9QuK0saV/odCbkeTJgk9PpHee5EH938LcgwuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce204ea55c24ba8cee5985f5875dc4feb68cb1d37e33e281bd378c1150d1283a","last_reissued_at":"2026-05-18T03:07:41.811844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:41.811844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.1987","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-18T03:07:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wYFSGxdJqe7N8nc9zt95gfgVzL9FAP6qQF5Dxqrj1PZuFslXgTeaNLXaoKyaia50C2gLfj58nFXXnpv0oFACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:18:19.693032Z"},"content_sha256":"51f0041d018ee2b47a62b5355fe95372c4cd890bd21a623a3fb454c01856951d","schema_version":"1.0","event_id":"sha256:51f0041d018ee2b47a62b5355fe95372c4cd890bd21a623a3fb454c01856951d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZYQE5JK4ES5IZ3SZQX2YOXOE72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Laplacian coefficients of unicyclic graphs with the number of leaves and girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Zhang, Xiao-Dong Zhang","submitted_at":"2013-11-08T14:44:52Z","abstract_excerpt":"Let $G$ be a graph of order $n$ and let $\\mathcal{L}(G,\\lambda)=\\sum_{k=0}^n (-1)^{k}c_{k}(G)\\lambda^{n-k}$ be the characteristic polynomial of its Laplacian matrix. Motivated by Ili\\'{c} and Ili\\'{c}'s conjecture [A. Ili\\'{c}, M. Ili\\'{c}, Laplacian coefficients of trees with given number of leaves or vertices of degree two, Linear Algebra and its Applications 431(2009)2195-2202.] on all extremal graphs which minimize all the Laplacian coefficients in the set $\\mathcal{U}_{n,l}$ of all $n$-vertex unicyclic graphs with the number of leaves $l$, we investigate properties of the minimal elements"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1987","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-18T03:07:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLLNVnzK8pYs/KUKt8b5GGuZhyMqIgphVZkz4JDNlUnl5CEj3spueWjro7qDmfmKsExG+Vde4Sql5GfLrcyRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:18:19.693387Z"},"content_sha256":"0e46fd8d94bbec2ec2036b9093d6ca3c032f2a31b76c3dd938d0b4c83bc64eee","schema_version":"1.0","event_id":"sha256:0e46fd8d94bbec2ec2036b9093d6ca3c032f2a31b76c3dd938d0b4c83bc64eee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYQE5JK4ES5IZ3SZQX2YOXOE72/bundle.json","state_url":"https://pith.science/pith/ZYQE5JK4ES5IZ3SZQX2YOXOE72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYQE5JK4ES5IZ3SZQX2YOXOE72/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-09T14:18:19Z","links":{"resolver":"https://pith.science/pith/ZYQE5JK4ES5IZ3SZQX2YOXOE72","bundle":"https://pith.science/pith/ZYQE5JK4ES5IZ3SZQX2YOXOE72/bundle.json","state":"https://pith.science/pith/ZYQE5JK4ES5IZ3SZQX2YOXOE72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYQE5JK4ES5IZ3SZQX2YOXOE72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZYQE5JK4ES5IZ3SZQX2YOXOE72","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":"1e438cbc774403c33020981229a57c8a49e21b53ebc220df72098825fc3482ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-08T14:44:52Z","title_canon_sha256":"5323d8372ce9ee9dba015da07fa0bd36254cd7aa39b37cf52ac9c51269598929"},"schema_version":"1.0","source":{"id":"1311.1987","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1987","created_at":"2026-05-18T03:07:41Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1987v1","created_at":"2026-05-18T03:07:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1987","created_at":"2026-05-18T03:07:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZYQE5JK4ES5I","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZYQE5JK4ES5IZ3SZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZYQE5JK4","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:0e46fd8d94bbec2ec2036b9093d6ca3c032f2a31b76c3dd938d0b4c83bc64eee","target":"graph","created_at":"2026-05-18T03:07:41Z","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":"Let $G$ be a graph of order $n$ and let $\\mathcal{L}(G,\\lambda)=\\sum_{k=0}^n (-1)^{k}c_{k}(G)\\lambda^{n-k}$ be the characteristic polynomial of its Laplacian matrix. Motivated by Ili\\'{c} and Ili\\'{c}'s conjecture [A. Ili\\'{c}, M. Ili\\'{c}, Laplacian coefficients of trees with given number of leaves or vertices of degree two, Linear Algebra and its Applications 431(2009)2195-2202.] on all extremal graphs which minimize all the Laplacian coefficients in the set $\\mathcal{U}_{n,l}$ of all $n$-vertex unicyclic graphs with the number of leaves $l$, we investigate properties of the minimal elements","authors_text":"Jie Zhang, Xiao-Dong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-08T14:44:52Z","title":"Laplacian coefficients of unicyclic graphs with the number of leaves and girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1987","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:51f0041d018ee2b47a62b5355fe95372c4cd890bd21a623a3fb454c01856951d","target":"record","created_at":"2026-05-18T03:07:41Z","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":"1e438cbc774403c33020981229a57c8a49e21b53ebc220df72098825fc3482ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-08T14:44:52Z","title_canon_sha256":"5323d8372ce9ee9dba015da07fa0bd36254cd7aa39b37cf52ac9c51269598929"},"schema_version":"1.0","source":{"id":"1311.1987","kind":"arxiv","version":1}},"canonical_sha256":"ce204ea55c24ba8cee5985f5875dc4feb68cb1d37e33e281bd378c1150d1283a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce204ea55c24ba8cee5985f5875dc4feb68cb1d37e33e281bd378c1150d1283a","first_computed_at":"2026-05-18T03:07:41.811844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:41.811844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C/T0cp37z8U8a2/tCcXXeMJVkbrPslp12TL3N07NQKxVJk/r9QuK0saV/odCbkeTJgk9PpHee5EH938LcgwuCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:41.812384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1987","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51f0041d018ee2b47a62b5355fe95372c4cd890bd21a623a3fb454c01856951d","sha256:0e46fd8d94bbec2ec2036b9093d6ca3c032f2a31b76c3dd938d0b4c83bc64eee"],"state_sha256":"73c320fc27e003c230bad1d9d0321e9bfbd8e58971da157361b618fc06dd9a4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YZ2bdzcFQK0FmJxs7U6/urnwXcPrSpTIGsfZXEu/HgQ439GZTPMaA+O1DH1ZLRDh5VCh68OJb/ZEyqmZlaVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:18:19.695413Z","bundle_sha256":"a1a1d4790852938f4c52e02ee6dc90b4650fa7ea475fd4aeb5ae8bb498463e07"}}