{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EPL27CEVIA7TGI7VVPVI66AZTY","short_pith_number":"pith:EPL27CEV","schema_version":"1.0","canonical_sha256":"23d7af8895403f3323f5abea8f78199e1b29c3427a784fb648d9e4d1b2288a49","source":{"kind":"arxiv","id":"2110.14712","version":2},"attestation_state":"computed","paper":{"title":"Complete characterization of the minimal-ABC trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Darko Dimitrov, Zhibin Du","submitted_at":"2021-10-27T18:59:39Z","abstract_excerpt":"The problem of characterizing trees with minimal atom-bond-connectivity index (minimal-ABC trees) has a reputation as one of the most demanding recent open optimization problems in mathematical chemistry. Here firstly, we give an affirmative answer to the conjecture, which states that enough large minimal-ABC trees are comprised solely of a root vertex and so-called $D_z$- and $D_{z+1}$-branches. Based on the presented theoretical results here and some already known results, we obtain enough constraints to reduce the search space and solve the optimization problem, and thus, determine exactly "},"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":"2110.14712","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-10-27T18:59:39Z","cross_cats_sorted":[],"title_canon_sha256":"6b91e760027f1a7e5f709124526b890a15f1a2ef9ed3c7515a34fed7f20a97a2","abstract_canon_sha256":"4d1ca49711afe04f483f71f6c5e2d9eb4519078b8cf9f1deebaa8576cbfe12e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:02.957188Z","signature_b64":"PMfjlkja48MwoyLnK+begeFNRAMn/KAHWHOmkPCwPzqUvF27ltIgvpGYcZQk3UB5GhgpcZbD9ATQZRWHx+DgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23d7af8895403f3323f5abea8f78199e1b29c3427a784fb648d9e4d1b2288a49","last_reissued_at":"2026-07-05T03:50:02.956579Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:02.956579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete characterization of the minimal-ABC trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Darko Dimitrov, Zhibin Du","submitted_at":"2021-10-27T18:59:39Z","abstract_excerpt":"The problem of characterizing trees with minimal atom-bond-connectivity index (minimal-ABC trees) has a reputation as one of the most demanding recent open optimization problems in mathematical chemistry. Here firstly, we give an affirmative answer to the conjecture, which states that enough large minimal-ABC trees are comprised solely of a root vertex and so-called $D_z$- and $D_{z+1}$-branches. Based on the presented theoretical results here and some already known results, we obtain enough constraints to reduce the search space and solve the optimization problem, and thus, determine exactly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.14712","kind":"arxiv","version":2},"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/2110.14712/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":"2110.14712","created_at":"2026-07-05T03:50:02.956647+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.14712v2","created_at":"2026-07-05T03:50:02.956647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.14712","created_at":"2026-07-05T03:50:02.956647+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPL27CEVIA7T","created_at":"2026-07-05T03:50:02.956647+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPL27CEVIA7TGI7V","created_at":"2026-07-05T03:50:02.956647+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPL27CEV","created_at":"2026-07-05T03:50:02.956647+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/EPL27CEVIA7TGI7VVPVI66AZTY","json":"https://pith.science/pith/EPL27CEVIA7TGI7VVPVI66AZTY.json","graph_json":"https://pith.science/api/pith-number/EPL27CEVIA7TGI7VVPVI66AZTY/graph.json","events_json":"https://pith.science/api/pith-number/EPL27CEVIA7TGI7VVPVI66AZTY/events.json","paper":"https://pith.science/paper/EPL27CEV"},"agent_actions":{"view_html":"https://pith.science/pith/EPL27CEVIA7TGI7VVPVI66AZTY","download_json":"https://pith.science/pith/EPL27CEVIA7TGI7VVPVI66AZTY.json","view_paper":"https://pith.science/paper/EPL27CEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.14712&json=true","fetch_graph":"https://pith.science/api/pith-number/EPL27CEVIA7TGI7VVPVI66AZTY/graph.json","fetch_events":"https://pith.science/api/pith-number/EPL27CEVIA7TGI7VVPVI66AZTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPL27CEVIA7TGI7VVPVI66AZTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPL27CEVIA7TGI7VVPVI66AZTY/action/storage_attestation","attest_author":"https://pith.science/pith/EPL27CEVIA7TGI7VVPVI66AZTY/action/author_attestation","sign_citation":"https://pith.science/pith/EPL27CEVIA7TGI7VVPVI66AZTY/action/citation_signature","submit_replication":"https://pith.science/pith/EPL27CEVIA7TGI7VVPVI66AZTY/action/replication_record"}},"created_at":"2026-07-05T03:50:02.956647+00:00","updated_at":"2026-07-05T03:50:02.956647+00:00"}