{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HGMAVMLBCEOQUETSWKRZH5RG32","short_pith_number":"pith:HGMAVMLB","canonical_record":{"source":{"id":"1704.05257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-18T10:02:54Z","cross_cats_sorted":[],"title_canon_sha256":"a77bed43d4321046320151dac372ca91871ef13df6d2ddf88a0f451835a3d130","abstract_canon_sha256":"9a6262d46d3502489c6e91bf7d5aec533536bffc85fbd5c1304fd137e6c9bd83"},"schema_version":"1.0"},"canonical_sha256":"39980ab161111d0a1272b2a393f626de8bda289161e6c8f052e052d37ba47663","source":{"kind":"arxiv","id":"1704.05257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05257","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05257v1","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05257","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"HGMAVMLBCEOQ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGMAVMLBCEOQUETS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGMAVMLB","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HGMAVMLBCEOQUETSWKRZH5RG32","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-18T10:02:54Z","cross_cats_sorted":[],"title_canon_sha256":"a77bed43d4321046320151dac372ca91871ef13df6d2ddf88a0f451835a3d130","abstract_canon_sha256":"9a6262d46d3502489c6e91bf7d5aec533536bffc85fbd5c1304fd137e6c9bd83"},"schema_version":"1.0"},"canonical_sha256":"39980ab161111d0a1272b2a393f626de8bda289161e6c8f052e052d37ba47663","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:11.409936Z","signature_b64":"/K7DaY66jVK1WbG2HL16xmjVArdO6/elFcWisyj/VphzGzXbguIFRkBH01SWiqFQwTqQtI6K2IlyFIPHx762Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39980ab161111d0a1272b2a393f626de8bda289161e6c8f052e052d37ba47663","last_reissued_at":"2026-05-18T00:46:11.409476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:11.409476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05257","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:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dadW1+qLvjmG2IZRY0sgJe14sjJvCjUI/M8gYudiF+CjT/g6H9uuzLug1gqQ6Fc/MZIYaTWI2rhNvVIki5ZIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:25:12.616418Z"},"content_sha256":"d79b57214770d906728a3b649f040ae3a7b1f9abc5e2681d350507073fb7d79f","schema_version":"1.0","event_id":"sha256:d79b57214770d906728a3b649f040ae3a7b1f9abc5e2681d350507073fb7d79f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HGMAVMLBCEOQUETSWKRZH5RG32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on some monotonic topological indices of bipartite graphs with a given number of cut edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hanlin Chen, Hanyuan Deng, Renfang Wu","submitted_at":"2017-04-18T10:02:54Z","abstract_excerpt":"Let $I(G)$ be a topological index of a graph. If $I(G+e)<I(G)$ (or $I(G+e)>I(G)$, respectively) for each edge $e\\not\\in G$, then $I(G)$ is monotonically decreasing (or increasing, respectively) with the addition of edges. In this article, we present lower or upper bounds for some monotonic topological indices, including the Wiener index, the hyper-Wiener index, the Harary index, the connective eccentricity index, the eccentricity distance sum of bipartite graphs in terms of the number of cut edges, and characterize the corresponding extremal graphs, respectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05257","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:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h4lWHwfcO04WfrJpHGRGK6MZayeyfX5GMVP6+GySl/Uu+ZSfZQml8BT37up26z4n88cL/ysawUplMt9DcRSDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:25:12.617132Z"},"content_sha256":"cb5708b79eafcd5538f025f29dac893a8af2c299ba3895e916370293127b1fac","schema_version":"1.0","event_id":"sha256:cb5708b79eafcd5538f025f29dac893a8af2c299ba3895e916370293127b1fac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGMAVMLBCEOQUETSWKRZH5RG32/bundle.json","state_url":"https://pith.science/pith/HGMAVMLBCEOQUETSWKRZH5RG32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGMAVMLBCEOQUETSWKRZH5RG32/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-28T18:25:12Z","links":{"resolver":"https://pith.science/pith/HGMAVMLBCEOQUETSWKRZH5RG32","bundle":"https://pith.science/pith/HGMAVMLBCEOQUETSWKRZH5RG32/bundle.json","state":"https://pith.science/pith/HGMAVMLBCEOQUETSWKRZH5RG32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGMAVMLBCEOQUETSWKRZH5RG32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HGMAVMLBCEOQUETSWKRZH5RG32","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":"9a6262d46d3502489c6e91bf7d5aec533536bffc85fbd5c1304fd137e6c9bd83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-18T10:02:54Z","title_canon_sha256":"a77bed43d4321046320151dac372ca91871ef13df6d2ddf88a0f451835a3d130"},"schema_version":"1.0","source":{"id":"1704.05257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05257","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05257v1","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05257","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"HGMAVMLBCEOQ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGMAVMLBCEOQUETS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGMAVMLB","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:cb5708b79eafcd5538f025f29dac893a8af2c299ba3895e916370293127b1fac","target":"graph","created_at":"2026-05-18T00:46:11Z","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":"Let $I(G)$ be a topological index of a graph. If $I(G+e)<I(G)$ (or $I(G+e)>I(G)$, respectively) for each edge $e\\not\\in G$, then $I(G)$ is monotonically decreasing (or increasing, respectively) with the addition of edges. In this article, we present lower or upper bounds for some monotonic topological indices, including the Wiener index, the hyper-Wiener index, the Harary index, the connective eccentricity index, the eccentricity distance sum of bipartite graphs in terms of the number of cut edges, and characterize the corresponding extremal graphs, respectively.","authors_text":"Hanlin Chen, Hanyuan Deng, Renfang Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-18T10:02:54Z","title":"Bounds on some monotonic topological indices of bipartite graphs with a given number of cut edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05257","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:d79b57214770d906728a3b649f040ae3a7b1f9abc5e2681d350507073fb7d79f","target":"record","created_at":"2026-05-18T00:46:11Z","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":"9a6262d46d3502489c6e91bf7d5aec533536bffc85fbd5c1304fd137e6c9bd83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-18T10:02:54Z","title_canon_sha256":"a77bed43d4321046320151dac372ca91871ef13df6d2ddf88a0f451835a3d130"},"schema_version":"1.0","source":{"id":"1704.05257","kind":"arxiv","version":1}},"canonical_sha256":"39980ab161111d0a1272b2a393f626de8bda289161e6c8f052e052d37ba47663","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39980ab161111d0a1272b2a393f626de8bda289161e6c8f052e052d37ba47663","first_computed_at":"2026-05-18T00:46:11.409476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:11.409476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/K7DaY66jVK1WbG2HL16xmjVArdO6/elFcWisyj/VphzGzXbguIFRkBH01SWiqFQwTqQtI6K2IlyFIPHx762Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:11.409936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d79b57214770d906728a3b649f040ae3a7b1f9abc5e2681d350507073fb7d79f","sha256:cb5708b79eafcd5538f025f29dac893a8af2c299ba3895e916370293127b1fac"],"state_sha256":"0964702616b051cf801bf330f6ac31c8e96d48addf1dd4fee55971672b12f423"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rg3QvRY5ruyTEovyQ5XZOh4MWKRWdB/2VIfhS7H0Fd1s7jy1XdFMlmt7Hlvtd2mQOGXSXXy3Gq+LIDrhfJlLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:25:12.620914Z","bundle_sha256":"7e0c4670703ae871af6cfa0a0cd7ddb80b1c60baf98a99151f92dbbe2d7617e0"}}