{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:74YBX3ZHE5OSMBOBIZ7TMUSVJM","short_pith_number":"pith:74YBX3ZH","schema_version":"1.0","canonical_sha256":"ff301bef27275d2605c1467f3652554b08dc418af8ecf2da41fb3633e81d6613","source":{"kind":"arxiv","id":"1210.6460","version":1},"attestation_state":"computed","paper":{"title":"On a relation between the Szeged index and the Wiener index for bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lily Chen, Mengmeng Liu, Xueliang Li","submitted_at":"2012-10-24T08:48:55Z","abstract_excerpt":"{\\small The Wiener index $W(G)$ of a graph $G$ is the sum of the distances between all pairs of vertices in the graph. The Szeged index $Sz(G)$ of a graph $G$ is defined as $Sz(G)=\\sum_{e=uv \\in E}n_u(e)n_v(e)$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$. Hansen used the computer programm AutoGraphiX and made the following conjecture about the Szeged index and the Wiener index for a bipartite connected graph $G$ with $n \\geq 4$ vertices "},"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":"1210.6460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-24T08:48:55Z","cross_cats_sorted":[],"title_canon_sha256":"af8cf759f44033b7df2546029bc396a7b0a4ff9fa3d7e0fc84902d0fbdcf14d3","abstract_canon_sha256":"746ef87400df90ab449c56f7a136175d2aabf7064fd2fef2867c55e0c53bee8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:24.776461Z","signature_b64":"EJgM41mksxfYhv6XVN2Xl1KhEMf8btyPIDUNe2pq6NLojqflNqZTVKn+FFDwNsn5Z2v+dAhVzaOm8XNTMVNPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff301bef27275d2605c1467f3652554b08dc418af8ecf2da41fb3633e81d6613","last_reissued_at":"2026-05-18T03:42:24.775722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:24.775722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a relation between the Szeged index and the Wiener index for bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lily Chen, Mengmeng Liu, Xueliang Li","submitted_at":"2012-10-24T08:48:55Z","abstract_excerpt":"{\\small The Wiener index $W(G)$ of a graph $G$ is the sum of the distances between all pairs of vertices in the graph. The Szeged index $Sz(G)$ of a graph $G$ is defined as $Sz(G)=\\sum_{e=uv \\in E}n_u(e)n_v(e)$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$. Hansen used the computer programm AutoGraphiX and made the following conjecture about the Szeged index and the Wiener index for a bipartite connected graph $G$ with $n \\geq 4$ vertices "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6460","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":"1210.6460","created_at":"2026-05-18T03:42:24.775841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6460v1","created_at":"2026-05-18T03:42:24.775841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6460","created_at":"2026-05-18T03:42:24.775841+00:00"},{"alias_kind":"pith_short_12","alias_value":"74YBX3ZHE5OS","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"74YBX3ZHE5OSMBOB","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"74YBX3ZH","created_at":"2026-05-18T12:26:56.085431+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/74YBX3ZHE5OSMBOBIZ7TMUSVJM","json":"https://pith.science/pith/74YBX3ZHE5OSMBOBIZ7TMUSVJM.json","graph_json":"https://pith.science/api/pith-number/74YBX3ZHE5OSMBOBIZ7TMUSVJM/graph.json","events_json":"https://pith.science/api/pith-number/74YBX3ZHE5OSMBOBIZ7TMUSVJM/events.json","paper":"https://pith.science/paper/74YBX3ZH"},"agent_actions":{"view_html":"https://pith.science/pith/74YBX3ZHE5OSMBOBIZ7TMUSVJM","download_json":"https://pith.science/pith/74YBX3ZHE5OSMBOBIZ7TMUSVJM.json","view_paper":"https://pith.science/paper/74YBX3ZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6460&json=true","fetch_graph":"https://pith.science/api/pith-number/74YBX3ZHE5OSMBOBIZ7TMUSVJM/graph.json","fetch_events":"https://pith.science/api/pith-number/74YBX3ZHE5OSMBOBIZ7TMUSVJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74YBX3ZHE5OSMBOBIZ7TMUSVJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74YBX3ZHE5OSMBOBIZ7TMUSVJM/action/storage_attestation","attest_author":"https://pith.science/pith/74YBX3ZHE5OSMBOBIZ7TMUSVJM/action/author_attestation","sign_citation":"https://pith.science/pith/74YBX3ZHE5OSMBOBIZ7TMUSVJM/action/citation_signature","submit_replication":"https://pith.science/pith/74YBX3ZHE5OSMBOBIZ7TMUSVJM/action/replication_record"}},"created_at":"2026-05-18T03:42:24.775841+00:00","updated_at":"2026-05-18T03:42:24.775841+00:00"}