{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KKYFEQVO7CTO53N6XQATYHBKZC","short_pith_number":"pith:KKYFEQVO","schema_version":"1.0","canonical_sha256":"52b05242aef8a6eeedbebc013c1c2ac89d8a6ca07a0d3cb313c63985415ba5d2","source":{"kind":"arxiv","id":"1704.00964","version":1},"attestation_state":"computed","paper":{"title":"On inverse Wiener interval problem of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jelena Sedlar","submitted_at":"2017-04-04T11:40:27Z","abstract_excerpt":"The Wiener index W(G) of a simple connected graph G is defined as the sum of distances over all pairs of vertices in a graph. We denote by W[T_{n}] the set of all values of Wiener index for a graph from class T_{n} of trees on n vertices. The largest interval of contiguous integers (contiguous even integers in case of odd n) is denoted by W^{int}[T_{n}]. In this paper we prove that both sets are of the cardinality (1/6)n^3+O(n^2) in the case of even n, while in the case of odd n we prove that the cardinality of both sets equals (1/(12))n^3+O(n^2) solving thus two conjectures posed in literatur"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1704.00964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-04T11:40:27Z","cross_cats_sorted":[],"title_canon_sha256":"c5eef44921f916fd01d19dc0fc7fbbdace4c5867c3d1e1b667881880fbf0d29b","abstract_canon_sha256":"7d33251cac19f9257b5d81b1f3ef2906d2f710f14c446b9e2082258d39324cb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:18.733870Z","signature_b64":"DRrgosUSc+5SwjMSnVpdAD354YV0We6Wpw6lAvP4mhKPuB/iXD35PNzVu4z5BT4uclJtYRlveniCSvGNzvOxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52b05242aef8a6eeedbebc013c1c2ac89d8a6ca07a0d3cb313c63985415ba5d2","last_reissued_at":"2026-05-18T00:47:18.733303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:18.733303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On inverse Wiener interval problem of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jelena Sedlar","submitted_at":"2017-04-04T11:40:27Z","abstract_excerpt":"The Wiener index W(G) of a simple connected graph G is defined as the sum of distances over all pairs of vertices in a graph. We denote by W[T_{n}] the set of all values of Wiener index for a graph from class T_{n} of trees on n vertices. The largest interval of contiguous integers (contiguous even integers in case of odd n) is denoted by W^{int}[T_{n}]. In this paper we prove that both sets are of the cardinality (1/6)n^3+O(n^2) in the case of even n, while in the case of odd n we prove that the cardinality of both sets equals (1/(12))n^3+O(n^2) solving thus two conjectures posed in literatur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00964","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.00964","created_at":"2026-05-18T00:47:18.733391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00964v1","created_at":"2026-05-18T00:47:18.733391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00964","created_at":"2026-05-18T00:47:18.733391+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKYFEQVO7CTO","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKYFEQVO7CTO53N6","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKYFEQVO","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC","json":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC.json","graph_json":"https://pith.science/api/pith-number/KKYFEQVO7CTO53N6XQATYHBKZC/graph.json","events_json":"https://pith.science/api/pith-number/KKYFEQVO7CTO53N6XQATYHBKZC/events.json","paper":"https://pith.science/paper/KKYFEQVO"},"agent_actions":{"view_html":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC","download_json":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC.json","view_paper":"https://pith.science/paper/KKYFEQVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00964&json=true","fetch_graph":"https://pith.science/api/pith-number/KKYFEQVO7CTO53N6XQATYHBKZC/graph.json","fetch_events":"https://pith.science/api/pith-number/KKYFEQVO7CTO53N6XQATYHBKZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC/action/storage_attestation","attest_author":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC/action/author_attestation","sign_citation":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC/action/citation_signature","submit_replication":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC/action/replication_record"}},"created_at":"2026-05-18T00:47:18.733391+00:00","updated_at":"2026-05-18T00:47:18.733391+00:00"}