{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:6LFTBQMQAUIYEA4OU34POPVKLJ","short_pith_number":"pith:6LFTBQMQ","schema_version":"1.0","canonical_sha256":"f2cb30c190051182038ea6f8f73eaa5a54236b088fbac8faceefa8c786785f00","source":{"kind":"arxiv","id":"2208.01984","version":1},"attestation_state":"computed","paper":{"title":"Disproof of a conjecture on the minimum Wiener index of signed trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chuanming Wang, Songlin Guo, Wei Wang","submitted_at":"2022-08-03T11:27:59Z","abstract_excerpt":"The Wiener index of a connected graph is the sum of distances between all unordered pairs of vertices. Sam Spiro [The Wiener index of signed graphs, Appl. Math. Comput., 416(2022)126755] recently introduced the Wiener index for a signed graph and conjectured that the path $P_n$ with alternating signs has the minimum Wiener index among all signed trees with $n$ vertices. By constructing an infinite family of counterexamples, we prove that the conjecture is false whenever $n$ is at least 30."},"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":"2208.01984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-03T11:27:59Z","cross_cats_sorted":[],"title_canon_sha256":"9c16f2d50b8ec5352c0be190df0cee13d3228d1171bc733df22b300ce8d07740","abstract_canon_sha256":"1edd158e4cc6b13f1fbfc5a7634af4c5cf601e8c86dc885bf006f6c7279a1471"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:45:52.261170Z","signature_b64":"Qy27XzY28RkINBKtqLSG841CoeY3TSm+50kYZFUqUNT3tymzE/nlL6EILFy49h9p2PftRjZuriApD+Y3nnisCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2cb30c190051182038ea6f8f73eaa5a54236b088fbac8faceefa8c786785f00","last_reissued_at":"2026-07-05T04:45:52.260769Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:45:52.260769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disproof of a conjecture on the minimum Wiener index of signed trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chuanming Wang, Songlin Guo, Wei Wang","submitted_at":"2022-08-03T11:27:59Z","abstract_excerpt":"The Wiener index of a connected graph is the sum of distances between all unordered pairs of vertices. Sam Spiro [The Wiener index of signed graphs, Appl. Math. Comput., 416(2022)126755] recently introduced the Wiener index for a signed graph and conjectured that the path $P_n$ with alternating signs has the minimum Wiener index among all signed trees with $n$ vertices. By constructing an infinite family of counterexamples, we prove that the conjecture is false whenever $n$ is at least 30."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.01984","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.01984/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2208.01984","created_at":"2026-07-05T04:45:52.260828+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.01984v1","created_at":"2026-07-05T04:45:52.260828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.01984","created_at":"2026-07-05T04:45:52.260828+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LFTBQMQAUIY","created_at":"2026-07-05T04:45:52.260828+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LFTBQMQAUIYEA4O","created_at":"2026-07-05T04:45:52.260828+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LFTBQMQ","created_at":"2026-07-05T04:45:52.260828+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/6LFTBQMQAUIYEA4OU34POPVKLJ","json":"https://pith.science/pith/6LFTBQMQAUIYEA4OU34POPVKLJ.json","graph_json":"https://pith.science/api/pith-number/6LFTBQMQAUIYEA4OU34POPVKLJ/graph.json","events_json":"https://pith.science/api/pith-number/6LFTBQMQAUIYEA4OU34POPVKLJ/events.json","paper":"https://pith.science/paper/6LFTBQMQ"},"agent_actions":{"view_html":"https://pith.science/pith/6LFTBQMQAUIYEA4OU34POPVKLJ","download_json":"https://pith.science/pith/6LFTBQMQAUIYEA4OU34POPVKLJ.json","view_paper":"https://pith.science/paper/6LFTBQMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.01984&json=true","fetch_graph":"https://pith.science/api/pith-number/6LFTBQMQAUIYEA4OU34POPVKLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6LFTBQMQAUIYEA4OU34POPVKLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LFTBQMQAUIYEA4OU34POPVKLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LFTBQMQAUIYEA4OU34POPVKLJ/action/storage_attestation","attest_author":"https://pith.science/pith/6LFTBQMQAUIYEA4OU34POPVKLJ/action/author_attestation","sign_citation":"https://pith.science/pith/6LFTBQMQAUIYEA4OU34POPVKLJ/action/citation_signature","submit_replication":"https://pith.science/pith/6LFTBQMQAUIYEA4OU34POPVKLJ/action/replication_record"}},"created_at":"2026-07-05T04:45:52.260828+00:00","updated_at":"2026-07-05T04:45:52.260828+00:00"}