{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5P23HKPDENL64JC3WHNVNSFNJU","short_pith_number":"pith:5P23HKPD","schema_version":"1.0","canonical_sha256":"ebf5b3a9e32357ee245bb1db56c8ad4d21b5c6f6097004339e816ad0fcb8ed54","source":{"kind":"arxiv","id":"1706.08680","version":1},"attestation_state":"computed","paper":{"title":"Forbidden branches in trees with minimal atom-bond connectivity index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Carlos M. da Fonseca, Darko Dimitrov, Zhibin Du","submitted_at":"2017-06-27T06:20:24Z","abstract_excerpt":"The atom-bond connectivity (ABC) index has been, in recent years, one of the most actively studied vertex-degree-based graph invariants in chemical graph theory. For a given graph $G$, the ABC index is defined as $\\sum_{uv\\in E}\\sqrt{\\frac{d(u) +d(v)-2}{d(u)d(v)}}$, where $d(u)$ is the degree of vertex $u$ in $G$ and $E(G)$ denotes the set of edges of $G$. In this paper we present some new structural properties of trees with a minimal ABC index (also refer to as a minimal-ABC tree), which is a step further towards understanding their complete characterization. We show that a minimal-ABC tree c"},"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":"1706.08680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-27T06:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"90b85a3a9c4cf54aee0a2fbcc241a269eba1f43da5e6d7a88ec57068741b8491","abstract_canon_sha256":"75cff53538a4b5f2327058a233aeff0746a3afe6f1ed7b1d8f4fe4d3315aa96f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:31.372142Z","signature_b64":"UC6LKsUZ9dsOKS0I9hxWp/Uv4yPzNErKeBPJRZ67gyWas5Coqy0I659H1Abe6ckNc60FniBZhLSRXqKtMGcQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebf5b3a9e32357ee245bb1db56c8ad4d21b5c6f6097004339e816ad0fcb8ed54","last_reissued_at":"2026-05-18T00:41:31.371424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:31.371424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forbidden branches in trees with minimal atom-bond connectivity index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Carlos M. da Fonseca, Darko Dimitrov, Zhibin Du","submitted_at":"2017-06-27T06:20:24Z","abstract_excerpt":"The atom-bond connectivity (ABC) index has been, in recent years, one of the most actively studied vertex-degree-based graph invariants in chemical graph theory. For a given graph $G$, the ABC index is defined as $\\sum_{uv\\in E}\\sqrt{\\frac{d(u) +d(v)-2}{d(u)d(v)}}$, where $d(u)$ is the degree of vertex $u$ in $G$ and $E(G)$ denotes the set of edges of $G$. In this paper we present some new structural properties of trees with a minimal ABC index (also refer to as a minimal-ABC tree), which is a step further towards understanding their complete characterization. We show that a minimal-ABC tree c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08680","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":"1706.08680","created_at":"2026-05-18T00:41:31.371549+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08680v1","created_at":"2026-05-18T00:41:31.371549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08680","created_at":"2026-05-18T00:41:31.371549+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/5P23HKPDENL64JC3WHNVNSFNJU","json":"https://pith.science/pith/5P23HKPDENL64JC3WHNVNSFNJU.json","graph_json":"https://pith.science/api/pith-number/5P23HKPDENL64JC3WHNVNSFNJU/graph.json","events_json":"https://pith.science/api/pith-number/5P23HKPDENL64JC3WHNVNSFNJU/events.json","paper":"https://pith.science/paper/5P23HKPD"},"agent_actions":{"view_html":"https://pith.science/pith/5P23HKPDENL64JC3WHNVNSFNJU","download_json":"https://pith.science/pith/5P23HKPDENL64JC3WHNVNSFNJU.json","view_paper":"https://pith.science/paper/5P23HKPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08680&json=true","fetch_graph":"https://pith.science/api/pith-number/5P23HKPDENL64JC3WHNVNSFNJU/graph.json","fetch_events":"https://pith.science/api/pith-number/5P23HKPDENL64JC3WHNVNSFNJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5P23HKPDENL64JC3WHNVNSFNJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5P23HKPDENL64JC3WHNVNSFNJU/action/storage_attestation","attest_author":"https://pith.science/pith/5P23HKPDENL64JC3WHNVNSFNJU/action/author_attestation","sign_citation":"https://pith.science/pith/5P23HKPDENL64JC3WHNVNSFNJU/action/citation_signature","submit_replication":"https://pith.science/pith/5P23HKPDENL64JC3WHNVNSFNJU/action/replication_record"}},"created_at":"2026-05-18T00:41:31.371549+00:00","updated_at":"2026-05-18T00:41:31.371549+00:00"}