{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UO3BZIVCJWQLZQIWPU4UD23XTS","short_pith_number":"pith:UO3BZIVC","canonical_record":{"source":{"id":"1501.05752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-23T09:36:43Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"301949671d882a9a618059eafdc6871d7f7d7593d435ebe952cbf30fc5c4c162","abstract_canon_sha256":"e33a8d7c1ff5b00880a2b739222614246d8673256fbd4a866c0762280c07aa40"},"schema_version":"1.0"},"canonical_sha256":"a3b61ca2a24da0bcc1167d3941eb779c9da6bbaf2d422384a4a42e26c153b31d","source":{"kind":"arxiv","id":"1501.05752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05752","created_at":"2026-05-18T02:28:49Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05752v1","created_at":"2026-05-18T02:28:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05752","created_at":"2026-05-18T02:28:49Z"},{"alias_kind":"pith_short_12","alias_value":"UO3BZIVCJWQL","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UO3BZIVCJWQLZQIW","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UO3BZIVC","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UO3BZIVCJWQLZQIWPU4UD23XTS","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-23T09:36:43Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"301949671d882a9a618059eafdc6871d7f7d7593d435ebe952cbf30fc5c4c162","abstract_canon_sha256":"e33a8d7c1ff5b00880a2b739222614246d8673256fbd4a866c0762280c07aa40"},"schema_version":"1.0"},"canonical_sha256":"a3b61ca2a24da0bcc1167d3941eb779c9da6bbaf2d422384a4a42e26c153b31d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:49.074429Z","signature_b64":"GdP1ZijNDXNpKxu/7ZOKT/+IQQHd32YMt9Tt6i1te84gJRRKj9XQjkyTvXZbXUHNmqbO2sILjbR8rwQgl5/UBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3b61ca2a24da0bcc1167d3941eb779c9da6bbaf2d422384a4a42e26c153b31d","last_reissued_at":"2026-05-18T02:28:49.074059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:49.074059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05752","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n48AyDVupsvZBlB/JqiTQlN87TbpNpypCeA0lzIlz0Pka0GdGLt2Fq5mnAWorQawTJKGDxBIFh865tWlD+YYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T09:07:18.212845Z"},"content_sha256":"617f00f5a08cf8b28ae25ba5e2ab5ea5fe9c449c4fb6c430cd81bfb57f7d3c9c","schema_version":"1.0","event_id":"sha256:617f00f5a08cf8b28ae25ba5e2ab5ea5fe9c449c4fb6c430cd81bfb57f7d3c9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UO3BZIVCJWQLZQIWPU4UD23XTS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On structural properties of trees with minimal atom-bond connectivity index II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Darko Dimitrov","submitted_at":"2015-01-23T09:36:43Z","abstract_excerpt":"The {\\em atom-bond connectivity (ABC) index} is a degree-based graph topological index that found chemical applications. The problem of complete characterization of trees with minimal $ABC$ index is still an open problem. In~\\cite{d-sptmabci-2014}, it was shown that trees with minimal ABC index do not contain so-called {\\em $B_k$-branches}, with $k \\geq 5$, and that they do not have more than four $B_4$-branches. Our main results here reveal that the number of $B_1$ and $B_2$-branches are also bounded from above by small fixed constants. Namely, we show that trees with minimal ABC index do not"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05752","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/YqIjcRl9i9KRvyA4hm+z+LnDck+ol13UVkZA/ILILwtnC+YBS20H6iLOpmM7jJOWszxz3TAH0ErgK23AtDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T09:07:18.213478Z"},"content_sha256":"7af8d940b9782b564f5d77500d0c0e5aa2f6aadd2d980c81f99c6d0563dab8e6","schema_version":"1.0","event_id":"sha256:7af8d940b9782b564f5d77500d0c0e5aa2f6aadd2d980c81f99c6d0563dab8e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UO3BZIVCJWQLZQIWPU4UD23XTS/bundle.json","state_url":"https://pith.science/pith/UO3BZIVCJWQLZQIWPU4UD23XTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UO3BZIVCJWQLZQIWPU4UD23XTS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T09:07:18Z","links":{"resolver":"https://pith.science/pith/UO3BZIVCJWQLZQIWPU4UD23XTS","bundle":"https://pith.science/pith/UO3BZIVCJWQLZQIWPU4UD23XTS/bundle.json","state":"https://pith.science/pith/UO3BZIVCJWQLZQIWPU4UD23XTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UO3BZIVCJWQLZQIWPU4UD23XTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UO3BZIVCJWQLZQIWPU4UD23XTS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e33a8d7c1ff5b00880a2b739222614246d8673256fbd4a866c0762280c07aa40","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-23T09:36:43Z","title_canon_sha256":"301949671d882a9a618059eafdc6871d7f7d7593d435ebe952cbf30fc5c4c162"},"schema_version":"1.0","source":{"id":"1501.05752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05752","created_at":"2026-05-18T02:28:49Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05752v1","created_at":"2026-05-18T02:28:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05752","created_at":"2026-05-18T02:28:49Z"},{"alias_kind":"pith_short_12","alias_value":"UO3BZIVCJWQL","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UO3BZIVCJWQLZQIW","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UO3BZIVC","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:7af8d940b9782b564f5d77500d0c0e5aa2f6aadd2d980c81f99c6d0563dab8e6","target":"graph","created_at":"2026-05-18T02:28:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The {\\em atom-bond connectivity (ABC) index} is a degree-based graph topological index that found chemical applications. The problem of complete characterization of trees with minimal $ABC$ index is still an open problem. In~\\cite{d-sptmabci-2014}, it was shown that trees with minimal ABC index do not contain so-called {\\em $B_k$-branches}, with $k \\geq 5$, and that they do not have more than four $B_4$-branches. Our main results here reveal that the number of $B_1$ and $B_2$-branches are also bounded from above by small fixed constants. Namely, we show that trees with minimal ABC index do not","authors_text":"Darko Dimitrov","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-23T09:36:43Z","title":"On structural properties of trees with minimal atom-bond connectivity index II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05752","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:617f00f5a08cf8b28ae25ba5e2ab5ea5fe9c449c4fb6c430cd81bfb57f7d3c9c","target":"record","created_at":"2026-05-18T02:28:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e33a8d7c1ff5b00880a2b739222614246d8673256fbd4a866c0762280c07aa40","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-23T09:36:43Z","title_canon_sha256":"301949671d882a9a618059eafdc6871d7f7d7593d435ebe952cbf30fc5c4c162"},"schema_version":"1.0","source":{"id":"1501.05752","kind":"arxiv","version":1}},"canonical_sha256":"a3b61ca2a24da0bcc1167d3941eb779c9da6bbaf2d422384a4a42e26c153b31d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3b61ca2a24da0bcc1167d3941eb779c9da6bbaf2d422384a4a42e26c153b31d","first_computed_at":"2026-05-18T02:28:49.074059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:49.074059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GdP1ZijNDXNpKxu/7ZOKT/+IQQHd32YMt9Tt6i1te84gJRRKj9XQjkyTvXZbXUHNmqbO2sILjbR8rwQgl5/UBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:49.074429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:617f00f5a08cf8b28ae25ba5e2ab5ea5fe9c449c4fb6c430cd81bfb57f7d3c9c","sha256:7af8d940b9782b564f5d77500d0c0e5aa2f6aadd2d980c81f99c6d0563dab8e6"],"state_sha256":"0d59b181cc4afb46b2f392b29574633175f3211507ce351887d0cc040b774915"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBR5UQjSh0Ey2u0Gk7k9/Te02XHHIxeSy6Gefzulfv1aUbmd4QXNL1PcWwMozHCZQdJDau1EpvC58e+Ndq8HBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T09:07:18.216973Z","bundle_sha256":"7c8e39bbcc4875397b032bc535a9c2674794f787a1018b248623275cf6ba5505"}}