{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AVEU7FWYZ3UY5CFSDXUEM6ENUM","short_pith_number":"pith:AVEU7FWY","schema_version":"1.0","canonical_sha256":"05494f96d8cee98e88b21de846788da30b207765f09d0b1856f703fff5d50275","source":{"kind":"arxiv","id":"1306.4164","version":1},"attestation_state":"computed","paper":{"title":"Extremal unicyclic graphs with respect to additively weighted Harary index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jelena Sedlar","submitted_at":"2013-06-18T12:39:22Z","abstract_excerpt":"In this paper we define cycle-star graph CSk,n-k to be a graph on n vertices consisting of the cycle of length k and n-k leafs appended to the same vertex of the cycle. Also, we define cycle-path graph CPk,n-k to be a graph on n vertices consisting of the cycle of length k and of path on n-k vertices whose one end is linked to a vertex on a cycle. We establish that cycle-star graph CS3,n-3 is the only maximal graph with respect to additively weighted Harary index among all unicyclic graphs on n vertices, while cycle-path graph CP3,n-3 is the only minimal unicyclic graph (here n must be at leas"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1306.4164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-18T12:39:22Z","cross_cats_sorted":[],"title_canon_sha256":"6c3ffac7805a9b229cc3c5ec11045ad29a765d97c0eccd549d1b104cbd5f1c75","abstract_canon_sha256":"52836db3657737fa9dcf641fb24bcdaedf922c6586d8ec05a9d2f386d4bb529f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:36.930353Z","signature_b64":"JbNoxmrzNMLhEQseOzQlQLXWRqxCeCbJtE7FjQE9zTswSFcYgzVcvjQ2o2mP5kF8rEjYvHeEoX7DpZqI86+2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05494f96d8cee98e88b21de846788da30b207765f09d0b1856f703fff5d50275","last_reissued_at":"2026-05-18T03:20:36.929633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:36.929633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal unicyclic graphs with respect to additively weighted Harary index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jelena Sedlar","submitted_at":"2013-06-18T12:39:22Z","abstract_excerpt":"In this paper we define cycle-star graph CSk,n-k to be a graph on n vertices consisting of the cycle of length k and n-k leafs appended to the same vertex of the cycle. Also, we define cycle-path graph CPk,n-k to be a graph on n vertices consisting of the cycle of length k and of path on n-k vertices whose one end is linked to a vertex on a cycle. We establish that cycle-star graph CS3,n-3 is the only maximal graph with respect to additively weighted Harary index among all unicyclic graphs on n vertices, while cycle-path graph CP3,n-3 is the only minimal unicyclic graph (here n must be at leas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4164","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.4164","created_at":"2026-05-18T03:20:36.929711+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4164v1","created_at":"2026-05-18T03:20:36.929711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4164","created_at":"2026-05-18T03:20:36.929711+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVEU7FWYZ3UY","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVEU7FWYZ3UY5CFS","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVEU7FWY","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AVEU7FWYZ3UY5CFSDXUEM6ENUM","json":"https://pith.science/pith/AVEU7FWYZ3UY5CFSDXUEM6ENUM.json","graph_json":"https://pith.science/api/pith-number/AVEU7FWYZ3UY5CFSDXUEM6ENUM/graph.json","events_json":"https://pith.science/api/pith-number/AVEU7FWYZ3UY5CFSDXUEM6ENUM/events.json","paper":"https://pith.science/paper/AVEU7FWY"},"agent_actions":{"view_html":"https://pith.science/pith/AVEU7FWYZ3UY5CFSDXUEM6ENUM","download_json":"https://pith.science/pith/AVEU7FWYZ3UY5CFSDXUEM6ENUM.json","view_paper":"https://pith.science/paper/AVEU7FWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4164&json=true","fetch_graph":"https://pith.science/api/pith-number/AVEU7FWYZ3UY5CFSDXUEM6ENUM/graph.json","fetch_events":"https://pith.science/api/pith-number/AVEU7FWYZ3UY5CFSDXUEM6ENUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVEU7FWYZ3UY5CFSDXUEM6ENUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVEU7FWYZ3UY5CFSDXUEM6ENUM/action/storage_attestation","attest_author":"https://pith.science/pith/AVEU7FWYZ3UY5CFSDXUEM6ENUM/action/author_attestation","sign_citation":"https://pith.science/pith/AVEU7FWYZ3UY5CFSDXUEM6ENUM/action/citation_signature","submit_replication":"https://pith.science/pith/AVEU7FWYZ3UY5CFSDXUEM6ENUM/action/replication_record"}},"created_at":"2026-05-18T03:20:36.929711+00:00","updated_at":"2026-05-18T03:20:36.929711+00:00"}