{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2IZZ325CWBSB6FCEBR6ENM2ZHP","short_pith_number":"pith:2IZZ325C","canonical_record":{"source":{"id":"1712.00695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-03T02:01:44Z","cross_cats_sorted":[],"title_canon_sha256":"b2e180c6b96696adebc12e0b123d1d23786ae73be0520ccf6fde3b1fb603344e","abstract_canon_sha256":"89630a7d588a1d85366f5cee96aa6cd53b54e92e92c900cdff589f433b05e566"},"schema_version":"1.0"},"canonical_sha256":"d2339deba2b0641f14440c7c46b3593bf8d85d30cae24dc5afe4d3ba05669672","source":{"kind":"arxiv","id":"1712.00695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00695","created_at":"2026-05-18T00:29:00Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00695v1","created_at":"2026-05-18T00:29:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00695","created_at":"2026-05-18T00:29:00Z"},{"alias_kind":"pith_short_12","alias_value":"2IZZ325CWBSB","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2IZZ325CWBSB6FCE","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2IZZ325C","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2IZZ325CWBSB6FCEBR6ENM2ZHP","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-03T02:01:44Z","cross_cats_sorted":[],"title_canon_sha256":"b2e180c6b96696adebc12e0b123d1d23786ae73be0520ccf6fde3b1fb603344e","abstract_canon_sha256":"89630a7d588a1d85366f5cee96aa6cd53b54e92e92c900cdff589f433b05e566"},"schema_version":"1.0"},"canonical_sha256":"d2339deba2b0641f14440c7c46b3593bf8d85d30cae24dc5afe4d3ba05669672","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:00.675110Z","signature_b64":"0E97bW7aX13G4sMMTfzE/0PJYmiI/R4p2l1h571ra05WKmO2HLsxPeqqdlsi5YDrVjbs3g9kgIL4vz3dNqpgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2339deba2b0641f14440c7c46b3593bf8d85d30cae24dc5afe4d3ba05669672","last_reissued_at":"2026-05-18T00:29:00.674491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:00.674491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00695","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:29:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UxjYx5bSr8FHjDTuPxM8pUHtwkYmdCYoCnYlFPNnbWFwf7vy4ntyoMPQ5tCEMd/0f3my2GqJznHGnpV2ghMwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:00:33.566513Z"},"content_sha256":"7d6da927cb68a4d11841356989d63bd46394785951c95ac095c87371516845c2","schema_version":"1.0","event_id":"sha256:7d6da927cb68a4d11841356989d63bd46394785951c95ac095c87371516845c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2IZZ325CWBSB6FCEBR6ENM2ZHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some extremal ratios of the distance and subtree problems in binary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hua Wang, Shuchao Li, Shujing Wang","submitted_at":"2017-12-03T02:01:44Z","abstract_excerpt":"Among many topological indices of trees the sum of distances $\\sigma(T)$ and the number of subtrees $F(T)$ have been a long standing pair of graph invariants that are well known for their negative correlation. That is, among various given classes of trees, the extremal structures maximizing one usually minimize the other, and vice versa. By introducing the \"local\" versions of these invariants, $\\sigma_T(v)$ for the sum of distance from $v$ to all other vertices and $F_T(v)$ for the number of subtrees containing $v$, extremal problems can be raised and studied for vertices within a tree. This l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00695","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:29:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJdkqyy9kv/evE+QY31yB1NvwjFeCAyIGqWlPFx6UqqJMsIFpIG/7bJEWdzjFThHAh2y0Hr05fJGKGY2tPVNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:00:33.567256Z"},"content_sha256":"e762b0f284aacb8b2d521e3f9d1aa1dc68bd336c1a2900cbb34e758a97abfdad","schema_version":"1.0","event_id":"sha256:e762b0f284aacb8b2d521e3f9d1aa1dc68bd336c1a2900cbb34e758a97abfdad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IZZ325CWBSB6FCEBR6ENM2ZHP/bundle.json","state_url":"https://pith.science/pith/2IZZ325CWBSB6FCEBR6ENM2ZHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IZZ325CWBSB6FCEBR6ENM2ZHP/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-06-08T18:00:33Z","links":{"resolver":"https://pith.science/pith/2IZZ325CWBSB6FCEBR6ENM2ZHP","bundle":"https://pith.science/pith/2IZZ325CWBSB6FCEBR6ENM2ZHP/bundle.json","state":"https://pith.science/pith/2IZZ325CWBSB6FCEBR6ENM2ZHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IZZ325CWBSB6FCEBR6ENM2ZHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2IZZ325CWBSB6FCEBR6ENM2ZHP","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":"89630a7d588a1d85366f5cee96aa6cd53b54e92e92c900cdff589f433b05e566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-03T02:01:44Z","title_canon_sha256":"b2e180c6b96696adebc12e0b123d1d23786ae73be0520ccf6fde3b1fb603344e"},"schema_version":"1.0","source":{"id":"1712.00695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00695","created_at":"2026-05-18T00:29:00Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00695v1","created_at":"2026-05-18T00:29:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00695","created_at":"2026-05-18T00:29:00Z"},{"alias_kind":"pith_short_12","alias_value":"2IZZ325CWBSB","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2IZZ325CWBSB6FCE","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2IZZ325C","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:e762b0f284aacb8b2d521e3f9d1aa1dc68bd336c1a2900cbb34e758a97abfdad","target":"graph","created_at":"2026-05-18T00:29:00Z","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":"Among many topological indices of trees the sum of distances $\\sigma(T)$ and the number of subtrees $F(T)$ have been a long standing pair of graph invariants that are well known for their negative correlation. That is, among various given classes of trees, the extremal structures maximizing one usually minimize the other, and vice versa. By introducing the \"local\" versions of these invariants, $\\sigma_T(v)$ for the sum of distance from $v$ to all other vertices and $F_T(v)$ for the number of subtrees containing $v$, extremal problems can be raised and studied for vertices within a tree. This l","authors_text":"Hua Wang, Shuchao Li, Shujing Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-03T02:01:44Z","title":"Some extremal ratios of the distance and subtree problems in binary trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00695","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:7d6da927cb68a4d11841356989d63bd46394785951c95ac095c87371516845c2","target":"record","created_at":"2026-05-18T00:29:00Z","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":"89630a7d588a1d85366f5cee96aa6cd53b54e92e92c900cdff589f433b05e566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-03T02:01:44Z","title_canon_sha256":"b2e180c6b96696adebc12e0b123d1d23786ae73be0520ccf6fde3b1fb603344e"},"schema_version":"1.0","source":{"id":"1712.00695","kind":"arxiv","version":1}},"canonical_sha256":"d2339deba2b0641f14440c7c46b3593bf8d85d30cae24dc5afe4d3ba05669672","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2339deba2b0641f14440c7c46b3593bf8d85d30cae24dc5afe4d3ba05669672","first_computed_at":"2026-05-18T00:29:00.674491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:00.674491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0E97bW7aX13G4sMMTfzE/0PJYmiI/R4p2l1h571ra05WKmO2HLsxPeqqdlsi5YDrVjbs3g9kgIL4vz3dNqpgBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:00.675110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d6da927cb68a4d11841356989d63bd46394785951c95ac095c87371516845c2","sha256:e762b0f284aacb8b2d521e3f9d1aa1dc68bd336c1a2900cbb34e758a97abfdad"],"state_sha256":"45873f7e64e3947e42770e646e7c54e664c3c432a5a2c572f386c70c3ad94cdb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IMpecTmhEqTMLN0Zn2LEOIuG+Riv1z64BzIa2ioEkjoT59pJzB7hrh5ad0H1Hx0vkbP2dMjytxP08xYDd6sWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:00:33.571411Z","bundle_sha256":"5b0f5727d70714bc1b4b683d192128074cd63b96205af9bf864ad2e2d51943b0"}}