{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KKYFEQVO7CTO53N6XQATYHBKZC","short_pith_number":"pith:KKYFEQVO","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"},"canonical_sha256":"52b05242aef8a6eeedbebc013c1c2ac89d8a6ca07a0d3cb313c63985415ba5d2","source":{"kind":"arxiv","id":"1704.00964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00964","created_at":"2026-05-18T00:47:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00964v1","created_at":"2026-05-18T00:47:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00964","created_at":"2026-05-18T00:47:18Z"},{"alias_kind":"pith_short_12","alias_value":"KKYFEQVO7CTO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KKYFEQVO7CTO53N6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KKYFEQVO","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KKYFEQVO7CTO53N6XQATYHBKZC","target":"record","payload":{"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"},"canonical_sha256":"52b05242aef8a6eeedbebc013c1c2ac89d8a6ca07a0d3cb313c63985415ba5d2","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"},"source_kind":"arxiv","source_id":"1704.00964","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:47:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vAWOjmtakk4MLiWtehn2UWsISnLpRAIeUjUnjtRK5mETa15uwWVFGrnws73rzM4d/NEFb3nVhG4PnDL73KciBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:00:20.679855Z"},"content_sha256":"4a6445543daa99f3363bd8d25ee2f73913915347b0c27e5ff5cc93586eefb8af","schema_version":"1.0","event_id":"sha256:4a6445543daa99f3363bd8d25ee2f73913915347b0c27e5ff5cc93586eefb8af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KKYFEQVO7CTO53N6XQATYHBKZC","target":"graph","payload":{"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"},"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:47:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rM6q0Mii6NN8up/sz2gMaiqdJO/sEs1KMqPONcjWAvWivLCpTEf5SUJ0mutPHF8a9WHPrufMJLW0I/mbIBSYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:00:20.680208Z"},"content_sha256":"7605f80a69890e2e3411482f1872f6de24c2c7c4a96d22aec7cd0b66efe55735","schema_version":"1.0","event_id":"sha256:7605f80a69890e2e3411482f1872f6de24c2c7c4a96d22aec7cd0b66efe55735"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC/bundle.json","state_url":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKYFEQVO7CTO53N6XQATYHBKZC/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-23T20:00:20Z","links":{"resolver":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC","bundle":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC/bundle.json","state":"https://pith.science/pith/KKYFEQVO7CTO53N6XQATYHBKZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKYFEQVO7CTO53N6XQATYHBKZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KKYFEQVO7CTO53N6XQATYHBKZC","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":"7d33251cac19f9257b5d81b1f3ef2906d2f710f14c446b9e2082258d39324cb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-04T11:40:27Z","title_canon_sha256":"c5eef44921f916fd01d19dc0fc7fbbdace4c5867c3d1e1b667881880fbf0d29b"},"schema_version":"1.0","source":{"id":"1704.00964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00964","created_at":"2026-05-18T00:47:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00964v1","created_at":"2026-05-18T00:47:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00964","created_at":"2026-05-18T00:47:18Z"},{"alias_kind":"pith_short_12","alias_value":"KKYFEQVO7CTO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KKYFEQVO7CTO53N6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KKYFEQVO","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:7605f80a69890e2e3411482f1872f6de24c2c7c4a96d22aec7cd0b66efe55735","target":"graph","created_at":"2026-05-18T00:47:18Z","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 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","authors_text":"Jelena Sedlar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-04T11:40:27Z","title":"On inverse Wiener interval problem of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00964","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:4a6445543daa99f3363bd8d25ee2f73913915347b0c27e5ff5cc93586eefb8af","target":"record","created_at":"2026-05-18T00:47:18Z","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":"7d33251cac19f9257b5d81b1f3ef2906d2f710f14c446b9e2082258d39324cb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-04T11:40:27Z","title_canon_sha256":"c5eef44921f916fd01d19dc0fc7fbbdace4c5867c3d1e1b667881880fbf0d29b"},"schema_version":"1.0","source":{"id":"1704.00964","kind":"arxiv","version":1}},"canonical_sha256":"52b05242aef8a6eeedbebc013c1c2ac89d8a6ca07a0d3cb313c63985415ba5d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52b05242aef8a6eeedbebc013c1c2ac89d8a6ca07a0d3cb313c63985415ba5d2","first_computed_at":"2026-05-18T00:47:18.733303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:18.733303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DRrgosUSc+5SwjMSnVpdAD354YV0We6Wpw6lAvP4mhKPuB/iXD35PNzVu4z5BT4uclJtYRlveniCSvGNzvOxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:18.733870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a6445543daa99f3363bd8d25ee2f73913915347b0c27e5ff5cc93586eefb8af","sha256:7605f80a69890e2e3411482f1872f6de24c2c7c4a96d22aec7cd0b66efe55735"],"state_sha256":"e609dbdf51cb0a2b89160e1b0616a8cc3b6983bbcc373e6bbec7eb41321de28f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRAnN98Zc1zLu6i4MUGWAZcW12jS8xiMUPa9XOL5kijPQdETEXN8GKGWgxgvREhyg8RkQeTWmgkvYAoXeWYtDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T20:00:20.682269Z","bundle_sha256":"02ee8176afa6703e43144831e1776c183eff6233cec3b9721d4ba90381e472b5"}}