{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RS3LTZZ6FCZTSEKI2TWZ77OKLO","short_pith_number":"pith:RS3LTZZ6","canonical_record":{"source":{"id":"1311.5691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T10:04:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3db6d4e529e66e02f8a09b8448e2c1c63ce98ace424073ffac86bea2cdd3aa58","abstract_canon_sha256":"6ca95c46adf0c4bb59088543a646dfa929a2ebe7eb6a8920f685172f1657e060"},"schema_version":"1.0"},"canonical_sha256":"8cb6b9e73e28b3391148d4ed9ffdca5bb8b26c19c161553ee7295ca4698bf5b9","source":{"kind":"arxiv","id":"1311.5691","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5691","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5691v1","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5691","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"RS3LTZZ6FCZT","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RS3LTZZ6FCZTSEKI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RS3LTZZ6","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RS3LTZZ6FCZTSEKI2TWZ77OKLO","target":"record","payload":{"canonical_record":{"source":{"id":"1311.5691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T10:04:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3db6d4e529e66e02f8a09b8448e2c1c63ce98ace424073ffac86bea2cdd3aa58","abstract_canon_sha256":"6ca95c46adf0c4bb59088543a646dfa929a2ebe7eb6a8920f685172f1657e060"},"schema_version":"1.0"},"canonical_sha256":"8cb6b9e73e28b3391148d4ed9ffdca5bb8b26c19c161553ee7295ca4698bf5b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:20.040049Z","signature_b64":"NYK31T1ap0CxqdGczZPxtAOew+RbAj7+H78O41XtC3PhQk9TydWiw6Ddd1DNodpyb69VBhMTOQ7EUEvKkGFxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cb6b9e73e28b3391148d4ed9ffdca5bb8b26c19c161553ee7295ca4698bf5b9","last_reissued_at":"2026-05-18T02:20:20.038279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:20.038279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.5691","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-18T02:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTZllj7GAdpOtKMcjNf5spcpFFqW0rDGMyWke2lYvqLv90mUjIMWNbt4nda9PIguJAX4cP5kGRi0bw9Kep8mBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:51:37.716787Z"},"content_sha256":"1d70ed84bc0e6016abc7dc7f1887f309f6c35d77694a95a930d20d24fd44734d","schema_version":"1.0","event_id":"sha256:1d70ed84bc0e6016abc7dc7f1887f309f6c35d77694a95a930d20d24fd44734d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RS3LTZZ6FCZTSEKI2TWZ77OKLO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New bounds of degree-based topological indices for some classes of $c$-cyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Alessandra Cornaro, Anna Torriero, Jos\\'e Luis Palacios, Monica Bianchi","submitted_at":"2013-11-22T10:04:55Z","abstract_excerpt":"Making use of a majorization technique for a suitable class of graphs, we derive upper and lower bounds for some topological indices depending on the degree sequence over all vertices, namely the first general Zagreb index and the first multiplicative Zagreb index. Specifically, after characterizing $c-$cyclic graphs $(0\\leq c\\leq 6)$ as those whose degree sequence belongs to particular subsets of $\\mathbb{R}^{n}$, we identify the maximal and minimal vectors of these subsets with respect to the majorization order. This technique allows us to determine lower and upper bounds of the above indice"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5691","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-18T02:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Si1tm2DNPuJvpfqCu8LV2VEuvD1TXQXkoDa19RqPMyMnSMwue1tAdgmme2Is+k5C9NslH4FiEd0h+knkOLWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:51:37.717265Z"},"content_sha256":"4dd0bc60a5eccf45c6df9d29d99816b72dd4e05c5a9833baf6108c81130614bb","schema_version":"1.0","event_id":"sha256:4dd0bc60a5eccf45c6df9d29d99816b72dd4e05c5a9833baf6108c81130614bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RS3LTZZ6FCZTSEKI2TWZ77OKLO/bundle.json","state_url":"https://pith.science/pith/RS3LTZZ6FCZTSEKI2TWZ77OKLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RS3LTZZ6FCZTSEKI2TWZ77OKLO/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-05T04:51:37Z","links":{"resolver":"https://pith.science/pith/RS3LTZZ6FCZTSEKI2TWZ77OKLO","bundle":"https://pith.science/pith/RS3LTZZ6FCZTSEKI2TWZ77OKLO/bundle.json","state":"https://pith.science/pith/RS3LTZZ6FCZTSEKI2TWZ77OKLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RS3LTZZ6FCZTSEKI2TWZ77OKLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RS3LTZZ6FCZTSEKI2TWZ77OKLO","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":"6ca95c46adf0c4bb59088543a646dfa929a2ebe7eb6a8920f685172f1657e060","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T10:04:55Z","title_canon_sha256":"3db6d4e529e66e02f8a09b8448e2c1c63ce98ace424073ffac86bea2cdd3aa58"},"schema_version":"1.0","source":{"id":"1311.5691","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5691","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5691v1","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5691","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"RS3LTZZ6FCZT","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RS3LTZZ6FCZTSEKI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RS3LTZZ6","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:4dd0bc60a5eccf45c6df9d29d99816b72dd4e05c5a9833baf6108c81130614bb","target":"graph","created_at":"2026-05-18T02:20:20Z","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":"Making use of a majorization technique for a suitable class of graphs, we derive upper and lower bounds for some topological indices depending on the degree sequence over all vertices, namely the first general Zagreb index and the first multiplicative Zagreb index. Specifically, after characterizing $c-$cyclic graphs $(0\\leq c\\leq 6)$ as those whose degree sequence belongs to particular subsets of $\\mathbb{R}^{n}$, we identify the maximal and minimal vectors of these subsets with respect to the majorization order. This technique allows us to determine lower and upper bounds of the above indice","authors_text":"Alessandra Cornaro, Anna Torriero, Jos\\'e Luis Palacios, Monica Bianchi","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T10:04:55Z","title":"New bounds of degree-based topological indices for some classes of $c$-cyclic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5691","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:1d70ed84bc0e6016abc7dc7f1887f309f6c35d77694a95a930d20d24fd44734d","target":"record","created_at":"2026-05-18T02:20:20Z","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":"6ca95c46adf0c4bb59088543a646dfa929a2ebe7eb6a8920f685172f1657e060","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T10:04:55Z","title_canon_sha256":"3db6d4e529e66e02f8a09b8448e2c1c63ce98ace424073ffac86bea2cdd3aa58"},"schema_version":"1.0","source":{"id":"1311.5691","kind":"arxiv","version":1}},"canonical_sha256":"8cb6b9e73e28b3391148d4ed9ffdca5bb8b26c19c161553ee7295ca4698bf5b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cb6b9e73e28b3391148d4ed9ffdca5bb8b26c19c161553ee7295ca4698bf5b9","first_computed_at":"2026-05-18T02:20:20.038279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:20.038279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NYK31T1ap0CxqdGczZPxtAOew+RbAj7+H78O41XtC3PhQk9TydWiw6Ddd1DNodpyb69VBhMTOQ7EUEvKkGFxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:20.040049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5691","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d70ed84bc0e6016abc7dc7f1887f309f6c35d77694a95a930d20d24fd44734d","sha256:4dd0bc60a5eccf45c6df9d29d99816b72dd4e05c5a9833baf6108c81130614bb"],"state_sha256":"2650d133bcbc763b38d7c98c6e8bd95da718715118342f0c60262683d60dfa89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4c0MzwB1j3BWVxCe6vumbSd9nxwFPoh3ikf9W/4/xcuRvCRXq/IniDI8zUn/cb0p6dIEzwjGkaQPdto7g1/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:51:37.720410Z","bundle_sha256":"1c20715eba461defb855e94fb3c5960e2435f1247342f3150e9ddb38ca741e77"}}