{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IOUAOGDQG2IJEFLCYJUH5IXKQY","short_pith_number":"pith:IOUAOGDQ","schema_version":"1.0","canonical_sha256":"43a80718703690921562c2687ea2ea8633cfd7a5877ba8a81f5218587042033e","source":{"kind":"arxiv","id":"1709.06301","version":1},"attestation_state":"computed","paper":{"title":"F-index of graphs based on new operations related to the join of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anita Pal, Nilanjan De, Prosanta Sarkar","submitted_at":"2017-09-19T09:00:15Z","abstract_excerpt":"The forgotten topological index or F-index of a graph is defined as the sum of degree cube of all the vertices of the graph. This index was introduced by Gutman and Trinajesti\\'{c} more than 40 years ago. In this paper, we derive F-index of new operations of subdivision graphs related to the graphs join."},"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":"1709.06301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-19T09:00:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9d4ff84a463adff5a647357faef20790a8f90ae994d167542085863b394581c7","abstract_canon_sha256":"0e661ba5f38fbf1871ee0651c6d176fc330c21160f4eb5f4616733f292f47f55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:53.634825Z","signature_b64":"y/Gpgb/wLwFgOxeBJvzvnRsB3DUPwRZdJkQjHoMy3GevgSyCSxFOHaATF4KTPX7UWCslVsItPneqk9XW4RN2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43a80718703690921562c2687ea2ea8633cfd7a5877ba8a81f5218587042033e","last_reissued_at":"2026-05-18T00:34:53.633971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:53.633971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"F-index of graphs based on new operations related to the join of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anita Pal, Nilanjan De, Prosanta Sarkar","submitted_at":"2017-09-19T09:00:15Z","abstract_excerpt":"The forgotten topological index or F-index of a graph is defined as the sum of degree cube of all the vertices of the graph. This index was introduced by Gutman and Trinajesti\\'{c} more than 40 years ago. In this paper, we derive F-index of new operations of subdivision graphs related to the graphs join."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06301","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":"1709.06301","created_at":"2026-05-18T00:34:53.634115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06301v1","created_at":"2026-05-18T00:34:53.634115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06301","created_at":"2026-05-18T00:34:53.634115+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOUAOGDQG2IJ","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOUAOGDQG2IJEFLC","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOUAOGDQ","created_at":"2026-05-18T12:31:21.493067+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/IOUAOGDQG2IJEFLCYJUH5IXKQY","json":"https://pith.science/pith/IOUAOGDQG2IJEFLCYJUH5IXKQY.json","graph_json":"https://pith.science/api/pith-number/IOUAOGDQG2IJEFLCYJUH5IXKQY/graph.json","events_json":"https://pith.science/api/pith-number/IOUAOGDQG2IJEFLCYJUH5IXKQY/events.json","paper":"https://pith.science/paper/IOUAOGDQ"},"agent_actions":{"view_html":"https://pith.science/pith/IOUAOGDQG2IJEFLCYJUH5IXKQY","download_json":"https://pith.science/pith/IOUAOGDQG2IJEFLCYJUH5IXKQY.json","view_paper":"https://pith.science/paper/IOUAOGDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06301&json=true","fetch_graph":"https://pith.science/api/pith-number/IOUAOGDQG2IJEFLCYJUH5IXKQY/graph.json","fetch_events":"https://pith.science/api/pith-number/IOUAOGDQG2IJEFLCYJUH5IXKQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOUAOGDQG2IJEFLCYJUH5IXKQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOUAOGDQG2IJEFLCYJUH5IXKQY/action/storage_attestation","attest_author":"https://pith.science/pith/IOUAOGDQG2IJEFLCYJUH5IXKQY/action/author_attestation","sign_citation":"https://pith.science/pith/IOUAOGDQG2IJEFLCYJUH5IXKQY/action/citation_signature","submit_replication":"https://pith.science/pith/IOUAOGDQG2IJEFLCYJUH5IXKQY/action/replication_record"}},"created_at":"2026-05-18T00:34:53.634115+00:00","updated_at":"2026-05-18T00:34:53.634115+00:00"}