{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SGZJD3O7PNWM3T2FGYY6KW43UQ","short_pith_number":"pith:SGZJD3O7","canonical_record":{"source":{"id":"1901.04764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-15T11:05:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b81d2439e5f7797384bd3b630f4540cc1f2ce31a1c0b21010c3a8541e3adbc3a","abstract_canon_sha256":"32a2d354018a9ea788a76c3242943655a09677b7f1593434577226d1d59d08f0"},"schema_version":"1.0"},"canonical_sha256":"91b291eddf7b6ccdcf453631e55b9ba407741acb4d0e20fe2b956643ae2242fe","source":{"kind":"arxiv","id":"1901.04764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04764","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04764v1","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04764","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"pith_short_12","alias_value":"SGZJD3O7PNWM","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SGZJD3O7PNWM3T2F","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SGZJD3O7","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SGZJD3O7PNWM3T2FGYY6KW43UQ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.04764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-15T11:05:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b81d2439e5f7797384bd3b630f4540cc1f2ce31a1c0b21010c3a8541e3adbc3a","abstract_canon_sha256":"32a2d354018a9ea788a76c3242943655a09677b7f1593434577226d1d59d08f0"},"schema_version":"1.0"},"canonical_sha256":"91b291eddf7b6ccdcf453631e55b9ba407741acb4d0e20fe2b956643ae2242fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:21.836045Z","signature_b64":"W1+1Idk9iswgGn5qOocBxyuBR1YeE7LZpFR86n8UXs3EN2LQmBDt+6daf8VBzGryx66vD65hBEeSHBz+5i2sCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91b291eddf7b6ccdcf453631e55b9ba407741acb4d0e20fe2b956643ae2242fe","last_reissued_at":"2026-05-17T23:56:21.835461Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:21.835461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.04764","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-17T23:56:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BvAKPEoqsNpaqZxqhMjpwtOPOxLlfG6uJCTIWGMw5gUdEv5x95o4rcmOuzM/Ng/k76fNVdbT2hHYanwdEEEuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:57:25.509155Z"},"content_sha256":"ac05d9580a503957a198b0a756e4cdb6916c9acd95900dc9004c756ea3eefdcc","schema_version":"1.0","event_id":"sha256:ac05d9580a503957a198b0a756e4cdb6916c9acd95900dc9004c756ea3eefdcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SGZJD3O7PNWM3T2FGYY6KW43UQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Extremal Graphs of Weighted Szeged Index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Boris Furtula, Jan Bok, Nikola Jedli\\v{c}kov\\'a, Riste \\v{S}krekovski","submitted_at":"2019-01-15T11:05:04Z","abstract_excerpt":"An extension of the well-known Szeged index was introduced recently, named as weighted Szeged index ($\\textrm{sz}(G)$). This paper is devoted to characterizing the extremal trees and graphs of this new topological invariant. In particular, we proved that the star is a tree having the maximal $\\textrm{sz}(G)$. Finding a tree with the minimal $\\textrm{sz}(G)$ is not an easy task to be done. Here, we present the minimal trees up to 25 vertices obtained by computer and describe the regularities which retain in them. Our preliminary computer tests suggest that a tree with the minimal $\\textrm{sz}(G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04764","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-17T23:56:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5VzcCnkZldp/fdsoRGj8X12kxRTmE/6dw+8dRi6l9ZfZd0PKkUS9d6yUSXjrBLeH6G/mXmp2zCPrgcsU1A8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:57:25.509517Z"},"content_sha256":"8c0504983bae576229ee6a8a9639d8ecd73383e02d7f5ff610bfaf652009a019","schema_version":"1.0","event_id":"sha256:8c0504983bae576229ee6a8a9639d8ecd73383e02d7f5ff610bfaf652009a019"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGZJD3O7PNWM3T2FGYY6KW43UQ/bundle.json","state_url":"https://pith.science/pith/SGZJD3O7PNWM3T2FGYY6KW43UQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGZJD3O7PNWM3T2FGYY6KW43UQ/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-20T08:57:25Z","links":{"resolver":"https://pith.science/pith/SGZJD3O7PNWM3T2FGYY6KW43UQ","bundle":"https://pith.science/pith/SGZJD3O7PNWM3T2FGYY6KW43UQ/bundle.json","state":"https://pith.science/pith/SGZJD3O7PNWM3T2FGYY6KW43UQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGZJD3O7PNWM3T2FGYY6KW43UQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SGZJD3O7PNWM3T2FGYY6KW43UQ","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":"32a2d354018a9ea788a76c3242943655a09677b7f1593434577226d1d59d08f0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-15T11:05:04Z","title_canon_sha256":"b81d2439e5f7797384bd3b630f4540cc1f2ce31a1c0b21010c3a8541e3adbc3a"},"schema_version":"1.0","source":{"id":"1901.04764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04764","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04764v1","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04764","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"pith_short_12","alias_value":"SGZJD3O7PNWM","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SGZJD3O7PNWM3T2F","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SGZJD3O7","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:8c0504983bae576229ee6a8a9639d8ecd73383e02d7f5ff610bfaf652009a019","target":"graph","created_at":"2026-05-17T23:56:21Z","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":"An extension of the well-known Szeged index was introduced recently, named as weighted Szeged index ($\\textrm{sz}(G)$). This paper is devoted to characterizing the extremal trees and graphs of this new topological invariant. In particular, we proved that the star is a tree having the maximal $\\textrm{sz}(G)$. Finding a tree with the minimal $\\textrm{sz}(G)$ is not an easy task to be done. Here, we present the minimal trees up to 25 vertices obtained by computer and describe the regularities which retain in them. Our preliminary computer tests suggest that a tree with the minimal $\\textrm{sz}(G","authors_text":"Boris Furtula, Jan Bok, Nikola Jedli\\v{c}kov\\'a, Riste \\v{S}krekovski","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-15T11:05:04Z","title":"On Extremal Graphs of Weighted Szeged Index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04764","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:ac05d9580a503957a198b0a756e4cdb6916c9acd95900dc9004c756ea3eefdcc","target":"record","created_at":"2026-05-17T23:56:21Z","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":"32a2d354018a9ea788a76c3242943655a09677b7f1593434577226d1d59d08f0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-15T11:05:04Z","title_canon_sha256":"b81d2439e5f7797384bd3b630f4540cc1f2ce31a1c0b21010c3a8541e3adbc3a"},"schema_version":"1.0","source":{"id":"1901.04764","kind":"arxiv","version":1}},"canonical_sha256":"91b291eddf7b6ccdcf453631e55b9ba407741acb4d0e20fe2b956643ae2242fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91b291eddf7b6ccdcf453631e55b9ba407741acb4d0e20fe2b956643ae2242fe","first_computed_at":"2026-05-17T23:56:21.835461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:21.835461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W1+1Idk9iswgGn5qOocBxyuBR1YeE7LZpFR86n8UXs3EN2LQmBDt+6daf8VBzGryx66vD65hBEeSHBz+5i2sCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:21.836045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.04764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac05d9580a503957a198b0a756e4cdb6916c9acd95900dc9004c756ea3eefdcc","sha256:8c0504983bae576229ee6a8a9639d8ecd73383e02d7f5ff610bfaf652009a019"],"state_sha256":"9007515713b4e6f45dd957de5285efc2f4f1876db19bf585530f88f360b6128c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7u5NVmt5AkUNxw6S3ajNlAvDYmAAH5A8tt1LC2Ciici5kia0oSw2Tu1zOu3ILToOaRMEhijQWtQuwXlxZU5RDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:57:25.511423Z","bundle_sha256":"17690afdc60a53c2b2ee4918e8f6f8ed6bed44b460729b59792555553dfaeb2a"}}