{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZVXPJBYPS4T2ZFEJTQGDAXTXV2","short_pith_number":"pith:ZVXPJBYP","canonical_record":{"source":{"id":"1706.08587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-26T20:47:53Z","cross_cats_sorted":[],"title_canon_sha256":"1e769e45d09b5809b097bb0fe3d02463735ec32b50ae53e81cf8e5c19deb1a73","abstract_canon_sha256":"7cbe1f2b0393c5bc902e17809df05de6ce57ccc12fa47b7b88f04b275cea35b9"},"schema_version":"1.0"},"canonical_sha256":"cd6ef4870f9727ac94899c0c305e77aea1977b61dc3a4d6291c2fc91a276625b","source":{"kind":"arxiv","id":"1706.08587","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08587","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08587v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08587","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZVXPJBYPS4T2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZVXPJBYPS4T2ZFEJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZVXPJBYP","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZVXPJBYPS4T2ZFEJTQGDAXTXV2","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-26T20:47:53Z","cross_cats_sorted":[],"title_canon_sha256":"1e769e45d09b5809b097bb0fe3d02463735ec32b50ae53e81cf8e5c19deb1a73","abstract_canon_sha256":"7cbe1f2b0393c5bc902e17809df05de6ce57ccc12fa47b7b88f04b275cea35b9"},"schema_version":"1.0"},"canonical_sha256":"cd6ef4870f9727ac94899c0c305e77aea1977b61dc3a4d6291c2fc91a276625b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:31.642901Z","signature_b64":"FR7XkfFtFZxtCPadRDXesek40rE1YBTC/Qe6rBasrrYQRQaOz0S434W553zeFXuRvL++8sPSj9OSCzmGzMouAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd6ef4870f9727ac94899c0c305e77aea1977b61dc3a4d6291c2fc91a276625b","last_reissued_at":"2026-05-18T00:41:31.642221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:31.642221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08587","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-18T00:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KAgPDBKlabRNusH7RvdLjN76g/5uP9IHdukghrdWAtj8wvOmYOJk7VvvgtKMml09LycHBXMRLyzRC6gy+krNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:32:17.291436Z"},"content_sha256":"114c2c2deee1df3fe04d9f6471fb0612fb062ebfe73f3adedffdcbf4bad77edb","schema_version":"1.0","event_id":"sha256:114c2c2deee1df3fe04d9f6471fb0612fb062ebfe73f3adedffdcbf4bad77edb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZVXPJBYPS4T2ZFEJTQGDAXTXV2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On structural properties of trees with minimal atom-bond connectivity index IV: Solving a conjecture about the pendent paths of length three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Darko Dimitrov","submitted_at":"2017-06-26T20:47:53Z","abstract_excerpt":"The atom-bond connectivity (ABC) index is one of the most investigated degree-based molecular structure descriptors with a variety of chemical applications. It is known that among all connected graphs, the trees minimize the ABC index. However, a full characterization of trees with a minimal ABC index is still an open problem. By now, one of the proved properties is that a tree with a minimal ABC index may have, at most, one pendent path of length $3$, with the conjecture that it cannot be a case if the order of a tree is larger than $1178$. Here, we provide an affirmative answer of a strength"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08587","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-18T00:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qm4aLPnHgFVGytejlordbmPQABiB7Ags7B0+5z5ZwYrYw6d9KzU8z79eGLL2uLsz1ANz7B25C2OIh90urnrEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:32:17.292004Z"},"content_sha256":"a9923917783d5e44aedd905a615be9a9c2fb6eecffa6551eb93fc28adeb46f8d","schema_version":"1.0","event_id":"sha256:a9923917783d5e44aedd905a615be9a9c2fb6eecffa6551eb93fc28adeb46f8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVXPJBYPS4T2ZFEJTQGDAXTXV2/bundle.json","state_url":"https://pith.science/pith/ZVXPJBYPS4T2ZFEJTQGDAXTXV2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVXPJBYPS4T2ZFEJTQGDAXTXV2/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-19T01:32:17Z","links":{"resolver":"https://pith.science/pith/ZVXPJBYPS4T2ZFEJTQGDAXTXV2","bundle":"https://pith.science/pith/ZVXPJBYPS4T2ZFEJTQGDAXTXV2/bundle.json","state":"https://pith.science/pith/ZVXPJBYPS4T2ZFEJTQGDAXTXV2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVXPJBYPS4T2ZFEJTQGDAXTXV2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZVXPJBYPS4T2ZFEJTQGDAXTXV2","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":"7cbe1f2b0393c5bc902e17809df05de6ce57ccc12fa47b7b88f04b275cea35b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-26T20:47:53Z","title_canon_sha256":"1e769e45d09b5809b097bb0fe3d02463735ec32b50ae53e81cf8e5c19deb1a73"},"schema_version":"1.0","source":{"id":"1706.08587","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08587","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08587v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08587","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZVXPJBYPS4T2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZVXPJBYPS4T2ZFEJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZVXPJBYP","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:a9923917783d5e44aedd905a615be9a9c2fb6eecffa6551eb93fc28adeb46f8d","target":"graph","created_at":"2026-05-18T00:41:31Z","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 atom-bond connectivity (ABC) index is one of the most investigated degree-based molecular structure descriptors with a variety of chemical applications. It is known that among all connected graphs, the trees minimize the ABC index. However, a full characterization of trees with a minimal ABC index is still an open problem. By now, one of the proved properties is that a tree with a minimal ABC index may have, at most, one pendent path of length $3$, with the conjecture that it cannot be a case if the order of a tree is larger than $1178$. Here, we provide an affirmative answer of a strength","authors_text":"Darko Dimitrov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-26T20:47:53Z","title":"On structural properties of trees with minimal atom-bond connectivity index IV: Solving a conjecture about the pendent paths of length three"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08587","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:114c2c2deee1df3fe04d9f6471fb0612fb062ebfe73f3adedffdcbf4bad77edb","target":"record","created_at":"2026-05-18T00:41:31Z","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":"7cbe1f2b0393c5bc902e17809df05de6ce57ccc12fa47b7b88f04b275cea35b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-26T20:47:53Z","title_canon_sha256":"1e769e45d09b5809b097bb0fe3d02463735ec32b50ae53e81cf8e5c19deb1a73"},"schema_version":"1.0","source":{"id":"1706.08587","kind":"arxiv","version":1}},"canonical_sha256":"cd6ef4870f9727ac94899c0c305e77aea1977b61dc3a4d6291c2fc91a276625b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd6ef4870f9727ac94899c0c305e77aea1977b61dc3a4d6291c2fc91a276625b","first_computed_at":"2026-05-18T00:41:31.642221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:31.642221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FR7XkfFtFZxtCPadRDXesek40rE1YBTC/Qe6rBasrrYQRQaOz0S434W553zeFXuRvL++8sPSj9OSCzmGzMouAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:31.642901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08587","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:114c2c2deee1df3fe04d9f6471fb0612fb062ebfe73f3adedffdcbf4bad77edb","sha256:a9923917783d5e44aedd905a615be9a9c2fb6eecffa6551eb93fc28adeb46f8d"],"state_sha256":"41e4d7827cf9346e2aa5f59e5ab5614847c0aa87f42b8e4e80f1af164f121910"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvJRNVRuZMH/mAIB3essTQB3wgixl3OyqJVTSdWL1PMOt5kgmE10rBbEczrit3A5gW2fZll7Z2ezYbRHXws3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T01:32:17.294055Z","bundle_sha256":"68b851d75c4eecca1082f623561c5e53f1343cd55054a66899f3c047faa648c7"}}