{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AK7MURT2BM3IJPC2MBIKATWNBY","short_pith_number":"pith:AK7MURT2","canonical_record":{"source":{"id":"1807.10967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-28T18:50:21Z","cross_cats_sorted":[],"title_canon_sha256":"e7972fb1d1b107683d6b173dfe933d567acb58be8bb0dfc8e3c709687253fe84","abstract_canon_sha256":"2534587753e44687eacdc79e0b16ad25a57506b08dd10450b4b8063916ec39a1"},"schema_version":"1.0"},"canonical_sha256":"02beca467a0b3684bc5a6050a04ecd0e197a6e54803956486ea188bb2ddf982a","source":{"kind":"arxiv","id":"1807.10967","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10967","created_at":"2026-05-18T00:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10967v1","created_at":"2026-05-18T00:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10967","created_at":"2026-05-18T00:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"AK7MURT2BM3I","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AK7MURT2BM3IJPC2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AK7MURT2","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AK7MURT2BM3IJPC2MBIKATWNBY","target":"record","payload":{"canonical_record":{"source":{"id":"1807.10967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-28T18:50:21Z","cross_cats_sorted":[],"title_canon_sha256":"e7972fb1d1b107683d6b173dfe933d567acb58be8bb0dfc8e3c709687253fe84","abstract_canon_sha256":"2534587753e44687eacdc79e0b16ad25a57506b08dd10450b4b8063916ec39a1"},"schema_version":"1.0"},"canonical_sha256":"02beca467a0b3684bc5a6050a04ecd0e197a6e54803956486ea188bb2ddf982a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:34.879470Z","signature_b64":"8Dww/abCVaICs1oGdCdbcPaDX0upgM7NAAk4otf3BoV0O3Eev8xCe5NrxrPM4qczVIPj0MSbaF2WnAGRpAjACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02beca467a0b3684bc5a6050a04ecd0e197a6e54803956486ea188bb2ddf982a","last_reissued_at":"2026-05-18T00:09:34.879015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:34.879015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.10967","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:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zOf1i/sq/w+qcykIUcETxb8vPOJLAiB1EQWzzZ8rbGrD5DKAjmvDhuijvje8CD79OhYaJ+0a3SrJngHbqemCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:42:38.629105Z"},"content_sha256":"15b188850544cad17f49a6361117ff5b968739192810da1216a192d1ed23df41","schema_version":"1.0","event_id":"sha256:15b188850544cad17f49a6361117ff5b968739192810da1216a192d1ed23df41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AK7MURT2BM3IJPC2MBIKATWNBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On roots of Wiener polynomials of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danielle Wang","submitted_at":"2018-07-28T18:50:21Z","abstract_excerpt":"The \\emph{Wiener polynomial} of a connected graph $G$ is the polynomial $W(G;x) = \\sum_{i=1}^{D(G)} d_i(G)x^i$ where $D(G)$ is the diameter of $G$, and $d_i(G)$ is the number of pairs of vertices at distance $i$ from each other. We examine the roots of Wiener polynomials of trees. We prove that the collection of real Wiener roots of trees is dense in $(-\\infty, 0]$, and the collection of complex Wiener roots of trees is dense in $\\mathbb C$. We also prove that the maximum modulus among all Wiener roots of trees of order $n \\ge 31$ is between $2n-15$ and $2n-16$, and we determine the unique tre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10967","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:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MrbwotJDKliF1p2lx4UHZ7W6kQ6o21GtbB7iy3y9ZLsRffgt2ct/uZ17JOWV+qeQoWO0EqFWDNJU+8o5iH1LCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:42:38.629467Z"},"content_sha256":"3664fba34cf8f0e2a34ef7f974595f8564a09ac99a767866a845c51b49af82a0","schema_version":"1.0","event_id":"sha256:3664fba34cf8f0e2a34ef7f974595f8564a09ac99a767866a845c51b49af82a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AK7MURT2BM3IJPC2MBIKATWNBY/bundle.json","state_url":"https://pith.science/pith/AK7MURT2BM3IJPC2MBIKATWNBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AK7MURT2BM3IJPC2MBIKATWNBY/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-23T08:42:38Z","links":{"resolver":"https://pith.science/pith/AK7MURT2BM3IJPC2MBIKATWNBY","bundle":"https://pith.science/pith/AK7MURT2BM3IJPC2MBIKATWNBY/bundle.json","state":"https://pith.science/pith/AK7MURT2BM3IJPC2MBIKATWNBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AK7MURT2BM3IJPC2MBIKATWNBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AK7MURT2BM3IJPC2MBIKATWNBY","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":"2534587753e44687eacdc79e0b16ad25a57506b08dd10450b4b8063916ec39a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-28T18:50:21Z","title_canon_sha256":"e7972fb1d1b107683d6b173dfe933d567acb58be8bb0dfc8e3c709687253fe84"},"schema_version":"1.0","source":{"id":"1807.10967","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10967","created_at":"2026-05-18T00:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10967v1","created_at":"2026-05-18T00:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10967","created_at":"2026-05-18T00:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"AK7MURT2BM3I","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AK7MURT2BM3IJPC2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AK7MURT2","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:3664fba34cf8f0e2a34ef7f974595f8564a09ac99a767866a845c51b49af82a0","target":"graph","created_at":"2026-05-18T00:09:34Z","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":"The \\emph{Wiener polynomial} of a connected graph $G$ is the polynomial $W(G;x) = \\sum_{i=1}^{D(G)} d_i(G)x^i$ where $D(G)$ is the diameter of $G$, and $d_i(G)$ is the number of pairs of vertices at distance $i$ from each other. We examine the roots of Wiener polynomials of trees. We prove that the collection of real Wiener roots of trees is dense in $(-\\infty, 0]$, and the collection of complex Wiener roots of trees is dense in $\\mathbb C$. We also prove that the maximum modulus among all Wiener roots of trees of order $n \\ge 31$ is between $2n-15$ and $2n-16$, and we determine the unique tre","authors_text":"Danielle Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-28T18:50:21Z","title":"On roots of Wiener polynomials of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10967","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:15b188850544cad17f49a6361117ff5b968739192810da1216a192d1ed23df41","target":"record","created_at":"2026-05-18T00:09:34Z","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":"2534587753e44687eacdc79e0b16ad25a57506b08dd10450b4b8063916ec39a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-28T18:50:21Z","title_canon_sha256":"e7972fb1d1b107683d6b173dfe933d567acb58be8bb0dfc8e3c709687253fe84"},"schema_version":"1.0","source":{"id":"1807.10967","kind":"arxiv","version":1}},"canonical_sha256":"02beca467a0b3684bc5a6050a04ecd0e197a6e54803956486ea188bb2ddf982a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02beca467a0b3684bc5a6050a04ecd0e197a6e54803956486ea188bb2ddf982a","first_computed_at":"2026-05-18T00:09:34.879015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:34.879015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Dww/abCVaICs1oGdCdbcPaDX0upgM7NAAk4otf3BoV0O3Eev8xCe5NrxrPM4qczVIPj0MSbaF2WnAGRpAjACw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:34.879470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10967","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15b188850544cad17f49a6361117ff5b968739192810da1216a192d1ed23df41","sha256:3664fba34cf8f0e2a34ef7f974595f8564a09ac99a767866a845c51b49af82a0"],"state_sha256":"ef8c75394bcc42cd974045a354be55a567a9d7fa2bc83268489c8d9403edc7da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E5MOAATDL3gq6yRQDDnvI7bDIgH78g0UC/QdAyb0WKEiQ/GZCa443j9iiNi+K2aktjVsSlBGRmp4/8bD75MtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:42:38.631865Z","bundle_sha256":"09c953ce9b5cfc06da4bd30874f9de1089e73399a508f24b0f6c8909e03876e1"}}