{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SLL3UIKZE6FRAPT6MUXI46WATZ","short_pith_number":"pith:SLL3UIKZ","canonical_record":{"source":{"id":"1609.04579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-15T11:45:37Z","cross_cats_sorted":[],"title_canon_sha256":"22c12226fa8cccc6a1395da5d8703531016db152be2c7628c084deabd48b27f5","abstract_canon_sha256":"0de8e49f31515e0290212d11cabfd20e4eca612d148a7b148eaac878e856470d"},"schema_version":"1.0"},"canonical_sha256":"92d7ba2159278b103e7e652e8e7ac09e720163e041326473806ae15f4ddb1b91","source":{"kind":"arxiv","id":"1609.04579","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04579","created_at":"2026-05-18T00:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04579v2","created_at":"2026-05-18T00:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04579","created_at":"2026-05-18T00:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"SLL3UIKZE6FR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SLL3UIKZE6FRAPT6","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SLL3UIKZ","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SLL3UIKZE6FRAPT6MUXI46WATZ","target":"record","payload":{"canonical_record":{"source":{"id":"1609.04579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-15T11:45:37Z","cross_cats_sorted":[],"title_canon_sha256":"22c12226fa8cccc6a1395da5d8703531016db152be2c7628c084deabd48b27f5","abstract_canon_sha256":"0de8e49f31515e0290212d11cabfd20e4eca612d148a7b148eaac878e856470d"},"schema_version":"1.0"},"canonical_sha256":"92d7ba2159278b103e7e652e8e7ac09e720163e041326473806ae15f4ddb1b91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:05.351158Z","signature_b64":"/2TC6tmrtZSUM8j8L5Z2kWlgqOaege++QVxpx08x3X2pTzj/xGr5njx/ZjcuH8CH7S1DdUoaSKPqjaBLN15eAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92d7ba2159278b103e7e652e8e7ac09e720163e041326473806ae15f4ddb1b91","last_reissued_at":"2026-05-18T00:31:05.350355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:05.350355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.04579","source_version":2,"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:31:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsJe5U58OB6IxWSb7Gz9J13Af7Rvcr9iGKHHQrN8XSbHXmGAIcB0xZbStPWteiO5cRjIqiN4ayngUQETyYgSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:08:52.630204Z"},"content_sha256":"1574e321fb2e764b337bb4ffe9a0d1cfae1f0f71a342275a8d1cb4b753b86fab","schema_version":"1.0","event_id":"sha256:1574e321fb2e764b337bb4ffe9a0d1cfae1f0f71a342275a8d1cb4b753b86fab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SLL3UIKZE6FRAPT6MUXI46WATZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a conjecture involving Laplacian eigenvalues of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David P. Jacobs, Vilmar Trevisan","submitted_at":"2016-09-15T11:45:37Z","abstract_excerpt":"Motivated by classic tree algorithms, in 1995 we designed a bottom-up $O(n)$ algorithm to compute the determinant of a tree's adjacency matrix $A$. In 2010 an $O(n)$ algorithm was found for constructing a diagonal matrix congruent to $A + xI_n$, $x \\in \\mathbb{R}$, enabling one to easily count the number of eigenvalues in any interval. A variation of the algorithm allows Laplacian eigenvalues in trees to be counted. We conjecture that for any tree $T$ of order $n \\geq 2$, at least half of its Laplacian eigenvalues are less than $\\bar{d} = 2 - \\frac{2}{n}$, its average vertex degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04579","kind":"arxiv","version":2},"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:31:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/hpaGb1VD/0oKdOLPeOzECZ4AN1+eBSI4uIrnzhXhIpYG+YV5qLmn0DmX79j7NJ7dj/HFKgmHJGwQZm3BF8nDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:08:52.630554Z"},"content_sha256":"ffef864ceb237a3f80599b224ed00c51889d4a67f9e49b81eda8e45d74dcb924","schema_version":"1.0","event_id":"sha256:ffef864ceb237a3f80599b224ed00c51889d4a67f9e49b81eda8e45d74dcb924"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLL3UIKZE6FRAPT6MUXI46WATZ/bundle.json","state_url":"https://pith.science/pith/SLL3UIKZE6FRAPT6MUXI46WATZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLL3UIKZE6FRAPT6MUXI46WATZ/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-09T13:08:52Z","links":{"resolver":"https://pith.science/pith/SLL3UIKZE6FRAPT6MUXI46WATZ","bundle":"https://pith.science/pith/SLL3UIKZE6FRAPT6MUXI46WATZ/bundle.json","state":"https://pith.science/pith/SLL3UIKZE6FRAPT6MUXI46WATZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLL3UIKZE6FRAPT6MUXI46WATZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SLL3UIKZE6FRAPT6MUXI46WATZ","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":"0de8e49f31515e0290212d11cabfd20e4eca612d148a7b148eaac878e856470d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-15T11:45:37Z","title_canon_sha256":"22c12226fa8cccc6a1395da5d8703531016db152be2c7628c084deabd48b27f5"},"schema_version":"1.0","source":{"id":"1609.04579","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04579","created_at":"2026-05-18T00:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04579v2","created_at":"2026-05-18T00:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04579","created_at":"2026-05-18T00:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"SLL3UIKZE6FR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SLL3UIKZE6FRAPT6","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SLL3UIKZ","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:ffef864ceb237a3f80599b224ed00c51889d4a67f9e49b81eda8e45d74dcb924","target":"graph","created_at":"2026-05-18T00:31:05Z","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":"Motivated by classic tree algorithms, in 1995 we designed a bottom-up $O(n)$ algorithm to compute the determinant of a tree's adjacency matrix $A$. In 2010 an $O(n)$ algorithm was found for constructing a diagonal matrix congruent to $A + xI_n$, $x \\in \\mathbb{R}$, enabling one to easily count the number of eigenvalues in any interval. A variation of the algorithm allows Laplacian eigenvalues in trees to be counted. We conjecture that for any tree $T$ of order $n \\geq 2$, at least half of its Laplacian eigenvalues are less than $\\bar{d} = 2 - \\frac{2}{n}$, its average vertex degree.","authors_text":"David P. Jacobs, Vilmar Trevisan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-15T11:45:37Z","title":"On a conjecture involving Laplacian eigenvalues of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04579","kind":"arxiv","version":2},"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:1574e321fb2e764b337bb4ffe9a0d1cfae1f0f71a342275a8d1cb4b753b86fab","target":"record","created_at":"2026-05-18T00:31:05Z","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":"0de8e49f31515e0290212d11cabfd20e4eca612d148a7b148eaac878e856470d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-15T11:45:37Z","title_canon_sha256":"22c12226fa8cccc6a1395da5d8703531016db152be2c7628c084deabd48b27f5"},"schema_version":"1.0","source":{"id":"1609.04579","kind":"arxiv","version":2}},"canonical_sha256":"92d7ba2159278b103e7e652e8e7ac09e720163e041326473806ae15f4ddb1b91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92d7ba2159278b103e7e652e8e7ac09e720163e041326473806ae15f4ddb1b91","first_computed_at":"2026-05-18T00:31:05.350355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:05.350355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/2TC6tmrtZSUM8j8L5Z2kWlgqOaege++QVxpx08x3X2pTzj/xGr5njx/ZjcuH8CH7S1DdUoaSKPqjaBLN15eAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:05.351158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.04579","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1574e321fb2e764b337bb4ffe9a0d1cfae1f0f71a342275a8d1cb4b753b86fab","sha256:ffef864ceb237a3f80599b224ed00c51889d4a67f9e49b81eda8e45d74dcb924"],"state_sha256":"0be112f5b6681cf91f40eaa9630472f718d7ad89ff3d7b64a350f5f3d7cce2d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lwLMyTFX3XJ7+13HhNCSW69rwifzArZu/C7gHBG8cpgwuULaocsk37mIEVsBNwPjOFnqlwtvaZF9Mie+PL09AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:08:52.632610Z","bundle_sha256":"15e0987fac0dcdbc6bfad081728473ed8d1942c2f2bf8e8cf3c7b9898b11bd8d"}}