{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4MIZ7YAS4IGEW4VCBZ57YAWCLA","short_pith_number":"pith:4MIZ7YAS","canonical_record":{"source":{"id":"1803.04657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-13T07:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"869567fe7928a05f97d5ee9f3aac6e50f7d3f76acdcdcb74095686a28c13510a","abstract_canon_sha256":"2a03435ac3513c6e062145ef83c9c28b56ba51838203fc7dad742ded1eafeee1"},"schema_version":"1.0"},"canonical_sha256":"e3119fe012e20c4b72a20e7bfc02c2582e120732145999f2b5a70fcc4c50f4bf","source":{"kind":"arxiv","id":"1803.04657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04657","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04657v1","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04657","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"4MIZ7YAS4IGE","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4MIZ7YAS4IGEW4VC","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4MIZ7YAS","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4MIZ7YAS4IGEW4VCBZ57YAWCLA","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-13T07:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"869567fe7928a05f97d5ee9f3aac6e50f7d3f76acdcdcb74095686a28c13510a","abstract_canon_sha256":"2a03435ac3513c6e062145ef83c9c28b56ba51838203fc7dad742ded1eafeee1"},"schema_version":"1.0"},"canonical_sha256":"e3119fe012e20c4b72a20e7bfc02c2582e120732145999f2b5a70fcc4c50f4bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:18.238966Z","signature_b64":"kbPiKbg3Y5RF0UZ4v+Lg8JRw9ROsG7XYnMSZuy1RYAMvs5FDe/POyTYb+oujED/hZcLZwOmUuPubHAm/RT/eCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3119fe012e20c4b72a20e7bfc02c2582e120732145999f2b5a70fcc4c50f4bf","last_reissued_at":"2026-05-18T00:21:18.238520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:18.238520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04657","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:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tq28Bg6m790Pi86I7D7y2dXPWqy+C7n3ZZbLuKoe6O2f8v4OY0SqMQ9zwoJe7MxrAQmBrp2Z/epVN5Bh87FgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:17:54.606579Z"},"content_sha256":"e5f18e4afa7f1c3ebf03ab3be9f725dcaa0e3e3cd64216b4ed09648168374292","schema_version":"1.0","event_id":"sha256:e5f18e4afa7f1c3ebf03ab3be9f725dcaa0e3e3cd64216b4ed09648168374292"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4MIZ7YAS4IGEW4VCBZ57YAWCLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on polyomino chains with extremum general sum-connectivity index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akbar Ali, Tahir Idrees","submitted_at":"2018-03-13T07:02:03Z","abstract_excerpt":"The general sum-connectivity index of a graph $G$ is defined as $\\chi_{\\alpha}(G)= \\sum_{uv\\in E(G)} (d_u + d_{v})^{\\alpha}$ where $d_{u}$ is degree of the vertex $u\\in V(G)$, $\\alpha$ is a real number different from $0$ and $uv$ is the edge connecting the vertices $u,v$. In this note, the problem of characterizing the graphs having extremum $\\chi_{\\alpha}$ values from a certain collection of polyomino chain graphs is solved for $\\alpha<0$. The obtained results together with already known results (concerning extremum values of polyomino chain graphs) give the complete solution of the aforement"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04657","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:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CWCW0U6opglVS6+0rwVMx9fEtZO0nsAnmbVk9Bv1Yearku70tXFCOx68RRZhoC9el29n+CgaQkXlfPhZcVKQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:17:54.607213Z"},"content_sha256":"e857b3d21bf71d0090c3009327009dd327b7dc862ff8e3c01ff7ed7defce884e","schema_version":"1.0","event_id":"sha256:e857b3d21bf71d0090c3009327009dd327b7dc862ff8e3c01ff7ed7defce884e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MIZ7YAS4IGEW4VCBZ57YAWCLA/bundle.json","state_url":"https://pith.science/pith/4MIZ7YAS4IGEW4VCBZ57YAWCLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MIZ7YAS4IGEW4VCBZ57YAWCLA/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-18T22:17:54Z","links":{"resolver":"https://pith.science/pith/4MIZ7YAS4IGEW4VCBZ57YAWCLA","bundle":"https://pith.science/pith/4MIZ7YAS4IGEW4VCBZ57YAWCLA/bundle.json","state":"https://pith.science/pith/4MIZ7YAS4IGEW4VCBZ57YAWCLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MIZ7YAS4IGEW4VCBZ57YAWCLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4MIZ7YAS4IGEW4VCBZ57YAWCLA","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":"2a03435ac3513c6e062145ef83c9c28b56ba51838203fc7dad742ded1eafeee1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-13T07:02:03Z","title_canon_sha256":"869567fe7928a05f97d5ee9f3aac6e50f7d3f76acdcdcb74095686a28c13510a"},"schema_version":"1.0","source":{"id":"1803.04657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04657","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04657v1","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04657","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"4MIZ7YAS4IGE","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4MIZ7YAS4IGEW4VC","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4MIZ7YAS","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:e857b3d21bf71d0090c3009327009dd327b7dc862ff8e3c01ff7ed7defce884e","target":"graph","created_at":"2026-05-18T00:21:18Z","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 general sum-connectivity index of a graph $G$ is defined as $\\chi_{\\alpha}(G)= \\sum_{uv\\in E(G)} (d_u + d_{v})^{\\alpha}$ where $d_{u}$ is degree of the vertex $u\\in V(G)$, $\\alpha$ is a real number different from $0$ and $uv$ is the edge connecting the vertices $u,v$. In this note, the problem of characterizing the graphs having extremum $\\chi_{\\alpha}$ values from a certain collection of polyomino chain graphs is solved for $\\alpha<0$. The obtained results together with already known results (concerning extremum values of polyomino chain graphs) give the complete solution of the aforement","authors_text":"Akbar Ali, Tahir Idrees","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-13T07:02:03Z","title":"A note on polyomino chains with extremum general sum-connectivity index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04657","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:e5f18e4afa7f1c3ebf03ab3be9f725dcaa0e3e3cd64216b4ed09648168374292","target":"record","created_at":"2026-05-18T00:21:18Z","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":"2a03435ac3513c6e062145ef83c9c28b56ba51838203fc7dad742ded1eafeee1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-13T07:02:03Z","title_canon_sha256":"869567fe7928a05f97d5ee9f3aac6e50f7d3f76acdcdcb74095686a28c13510a"},"schema_version":"1.0","source":{"id":"1803.04657","kind":"arxiv","version":1}},"canonical_sha256":"e3119fe012e20c4b72a20e7bfc02c2582e120732145999f2b5a70fcc4c50f4bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3119fe012e20c4b72a20e7bfc02c2582e120732145999f2b5a70fcc4c50f4bf","first_computed_at":"2026-05-18T00:21:18.238520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:18.238520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kbPiKbg3Y5RF0UZ4v+Lg8JRw9ROsG7XYnMSZuy1RYAMvs5FDe/POyTYb+oujED/hZcLZwOmUuPubHAm/RT/eCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:18.238966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5f18e4afa7f1c3ebf03ab3be9f725dcaa0e3e3cd64216b4ed09648168374292","sha256:e857b3d21bf71d0090c3009327009dd327b7dc862ff8e3c01ff7ed7defce884e"],"state_sha256":"ad0f53445a22e746bc6428330717aae045835ba8917276b7a135d33c2ad51e46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03lLYmQlKEOEIsztc3yNCQdn7kFLUXZrkOR4GLYcrS1Dw+QpPExorXPqix5qMXY09DSrwDaEFAvhiXDpJpODBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T22:17:54.609154Z","bundle_sha256":"461920261c4202d8a962366b04db58f3df5c23d8af1f68fed7265ac5e16fb369"}}