{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6ZZ25D7JTZ3AAZBXBGKTJIJCF2","short_pith_number":"pith:6ZZ25D7J","schema_version":"1.0","canonical_sha256":"f673ae8fe99e76006437099534a1222e97a7db3a760422c50c8052067195102f","source":{"kind":"arxiv","id":"1407.1592","version":1},"attestation_state":"computed","paper":{"title":"M-Polynomial and Degree-Based Topological Indices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emeric Deutsch, Sandi Klav\\v{z}ar","submitted_at":"2014-07-07T06:36:56Z","abstract_excerpt":"Let $G$ be a graph and let $m_{ij}(G)$, $i,j\\ge 1$, be the number of edges $uv$ of $G$ such that $\\{d_v(G), d_u(G)\\} = \\{i,j\\}$. The {\\em $M$-polynomial} of $G$ is introduced with $\\displaystyle{M(G;x,y) = \\sum_{i\\le j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular case to the single problem of determining the $M$-polynomial. The new approach is also illustrated with examples."},"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":"1407.1592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-07T06:36:56Z","cross_cats_sorted":[],"title_canon_sha256":"7bd0b57e49eb97f369ca84207399f09a6e4b47470e19455b4562951a1c985297","abstract_canon_sha256":"808ab64db073d9c7b807a53072b79bda400633dfc595c9b59805cfb11f4b5737"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:10.981723Z","signature_b64":"CMf9KwHVzyx2spEjh2NLlVdVSota86kTqbL0iJ3OfIMD9BhYSVxxy+KcyaRBGo9XXTBjqofF6C6Z3NWvH5JZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f673ae8fe99e76006437099534a1222e97a7db3a760422c50c8052067195102f","last_reissued_at":"2026-05-18T02:48:10.981060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:10.981060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"M-Polynomial and Degree-Based Topological Indices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emeric Deutsch, Sandi Klav\\v{z}ar","submitted_at":"2014-07-07T06:36:56Z","abstract_excerpt":"Let $G$ be a graph and let $m_{ij}(G)$, $i,j\\ge 1$, be the number of edges $uv$ of $G$ such that $\\{d_v(G), d_u(G)\\} = \\{i,j\\}$. The {\\em $M$-polynomial} of $G$ is introduced with $\\displaystyle{M(G;x,y) = \\sum_{i\\le j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular case to the single problem of determining the $M$-polynomial. The new approach is also illustrated with examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1592","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":"1407.1592","created_at":"2026-05-18T02:48:10.981166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1592v1","created_at":"2026-05-18T02:48:10.981166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1592","created_at":"2026-05-18T02:48:10.981166+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZZ25D7JTZ3A","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZZ25D7JTZ3AAZBX","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZZ25D7J","created_at":"2026-05-18T12:28:16.859392+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/6ZZ25D7JTZ3AAZBXBGKTJIJCF2","json":"https://pith.science/pith/6ZZ25D7JTZ3AAZBXBGKTJIJCF2.json","graph_json":"https://pith.science/api/pith-number/6ZZ25D7JTZ3AAZBXBGKTJIJCF2/graph.json","events_json":"https://pith.science/api/pith-number/6ZZ25D7JTZ3AAZBXBGKTJIJCF2/events.json","paper":"https://pith.science/paper/6ZZ25D7J"},"agent_actions":{"view_html":"https://pith.science/pith/6ZZ25D7JTZ3AAZBXBGKTJIJCF2","download_json":"https://pith.science/pith/6ZZ25D7JTZ3AAZBXBGKTJIJCF2.json","view_paper":"https://pith.science/paper/6ZZ25D7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1592&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZZ25D7JTZ3AAZBXBGKTJIJCF2/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZZ25D7JTZ3AAZBXBGKTJIJCF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZZ25D7JTZ3AAZBXBGKTJIJCF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZZ25D7JTZ3AAZBXBGKTJIJCF2/action/storage_attestation","attest_author":"https://pith.science/pith/6ZZ25D7JTZ3AAZBXBGKTJIJCF2/action/author_attestation","sign_citation":"https://pith.science/pith/6ZZ25D7JTZ3AAZBXBGKTJIJCF2/action/citation_signature","submit_replication":"https://pith.science/pith/6ZZ25D7JTZ3AAZBXBGKTJIJCF2/action/replication_record"}},"created_at":"2026-05-18T02:48:10.981166+00:00","updated_at":"2026-05-18T02:48:10.981166+00:00"}