{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TRPY4FMPNRHCUWXOYYIMTUSO2W","short_pith_number":"pith:TRPY4FMP","canonical_record":{"source":{"id":"1104.2122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-12T06:53:16Z","cross_cats_sorted":[],"title_canon_sha256":"a86c8054a43469d3cd705eeaad22d338e09b9e04bd2da747058c58dc9f519ac3","abstract_canon_sha256":"e39169b029767ecbeb9598ad7bff1efda122bfdb6abe6a08687bface6baca5b9"},"schema_version":"1.0"},"canonical_sha256":"9c5f8e158f6c4e2a5aeec610c9d24ed58c135ce69d17c03fdbd38a57bde430fb","source":{"kind":"arxiv","id":"1104.2122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2122","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2122v1","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2122","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"TRPY4FMPNRHC","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TRPY4FMPNRHCUWXO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TRPY4FMP","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TRPY4FMPNRHCUWXOYYIMTUSO2W","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-12T06:53:16Z","cross_cats_sorted":[],"title_canon_sha256":"a86c8054a43469d3cd705eeaad22d338e09b9e04bd2da747058c58dc9f519ac3","abstract_canon_sha256":"e39169b029767ecbeb9598ad7bff1efda122bfdb6abe6a08687bface6baca5b9"},"schema_version":"1.0"},"canonical_sha256":"9c5f8e158f6c4e2a5aeec610c9d24ed58c135ce69d17c03fdbd38a57bde430fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:35.874938Z","signature_b64":"hlqnjiBXnNcQ/MC74KrYe5sDZLLgwvIAkrgWXXx4u1G6RziRc0/xMMKiofWExQa7XkLPthkbXvr55ciBzHteDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c5f8e158f6c4e2a5aeec610c9d24ed58c135ce69d17c03fdbd38a57bde430fb","last_reissued_at":"2026-05-18T04:24:35.874418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:35.874418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2122","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-18T04:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+5CarYaDNlDUupuys/IkF9/mvFaRXUiOIVUgS5wge2Btf+Zu64WaQQeAe2jVSFoHqF6bfqHOooR+IIqzKMrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:31:00.443904Z"},"content_sha256":"fd13d6638569e9b227ca89a8aeea6bfe251d36b69ce755ba13e0e67fe0ec488f","schema_version":"1.0","event_id":"sha256:fd13d6638569e9b227ca89a8aeea6bfe251d36b69ce755ba13e0e67fe0ec488f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TRPY4FMPNRHCUWXOYYIMTUSO2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bicyclic graphs with maximal revised Szeged index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mengmeng Liu, Xueliang Li","submitted_at":"2011-04-12T06:53:16Z","abstract_excerpt":"The revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\\sum_{e=uv \\in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$. Hansen used the AutoGraphiX and made the following conjecture about the revised Szeged index for a connected bicyclic graph $G$ of order $n \\geq 6$: $$ Sz^*(G)\\leq \\{{array}{ll} (n^3+n^2-n-1)/4,& {if $n$ is odd}, (n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2122","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-18T04:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFcgibXZO3mHkVo0MAt1q/2JQSNacA+tSzJer9nJkkQOa6QHFbaR27T5qXjNyfYnFqo3fDiX+4qLP9qv6yE8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:31:00.444246Z"},"content_sha256":"a974469f81eb69874b48066a9cd157389351f1cb7d309cf99f4c51b33e1f7000","schema_version":"1.0","event_id":"sha256:a974469f81eb69874b48066a9cd157389351f1cb7d309cf99f4c51b33e1f7000"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRPY4FMPNRHCUWXOYYIMTUSO2W/bundle.json","state_url":"https://pith.science/pith/TRPY4FMPNRHCUWXOYYIMTUSO2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRPY4FMPNRHCUWXOYYIMTUSO2W/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-01T20:31:00Z","links":{"resolver":"https://pith.science/pith/TRPY4FMPNRHCUWXOYYIMTUSO2W","bundle":"https://pith.science/pith/TRPY4FMPNRHCUWXOYYIMTUSO2W/bundle.json","state":"https://pith.science/pith/TRPY4FMPNRHCUWXOYYIMTUSO2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRPY4FMPNRHCUWXOYYIMTUSO2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TRPY4FMPNRHCUWXOYYIMTUSO2W","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":"e39169b029767ecbeb9598ad7bff1efda122bfdb6abe6a08687bface6baca5b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-12T06:53:16Z","title_canon_sha256":"a86c8054a43469d3cd705eeaad22d338e09b9e04bd2da747058c58dc9f519ac3"},"schema_version":"1.0","source":{"id":"1104.2122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2122","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2122v1","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2122","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"TRPY4FMPNRHC","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TRPY4FMPNRHCUWXO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TRPY4FMP","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:a974469f81eb69874b48066a9cd157389351f1cb7d309cf99f4c51b33e1f7000","target":"graph","created_at":"2026-05-18T04:24:35Z","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 revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\\sum_{e=uv \\in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$. Hansen used the AutoGraphiX and made the following conjecture about the revised Szeged index for a connected bicyclic graph $G$ of order $n \\geq 6$: $$ Sz^*(G)\\leq \\{{array}{ll} (n^3+n^2-n-1)/4,& {if $n$ is odd}, (n","authors_text":"Mengmeng Liu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-12T06:53:16Z","title":"Bicyclic graphs with maximal revised Szeged index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2122","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:fd13d6638569e9b227ca89a8aeea6bfe251d36b69ce755ba13e0e67fe0ec488f","target":"record","created_at":"2026-05-18T04:24:35Z","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":"e39169b029767ecbeb9598ad7bff1efda122bfdb6abe6a08687bface6baca5b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-12T06:53:16Z","title_canon_sha256":"a86c8054a43469d3cd705eeaad22d338e09b9e04bd2da747058c58dc9f519ac3"},"schema_version":"1.0","source":{"id":"1104.2122","kind":"arxiv","version":1}},"canonical_sha256":"9c5f8e158f6c4e2a5aeec610c9d24ed58c135ce69d17c03fdbd38a57bde430fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c5f8e158f6c4e2a5aeec610c9d24ed58c135ce69d17c03fdbd38a57bde430fb","first_computed_at":"2026-05-18T04:24:35.874418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:35.874418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hlqnjiBXnNcQ/MC74KrYe5sDZLLgwvIAkrgWXXx4u1G6RziRc0/xMMKiofWExQa7XkLPthkbXvr55ciBzHteDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:35.874938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd13d6638569e9b227ca89a8aeea6bfe251d36b69ce755ba13e0e67fe0ec488f","sha256:a974469f81eb69874b48066a9cd157389351f1cb7d309cf99f4c51b33e1f7000"],"state_sha256":"d994458a3e80e61bdf906724d42a70e155b11ea8b5482f40855e3d5f2969a13c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDYZwvF5WjBDRlEhaME1MvP541is0C4T/YF6gM1hRUpEN9wBqhwNQYg+OIzZG6ZYFZ1xFf5OchU2go/Of7sSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:31:00.446109Z","bundle_sha256":"4ffa077d8956ec4e0909d7d3fb190bcc16b425132ca949535314f8230fe39d13"}}