{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ODXGDRPA7IOD3XFHKCEUAZAOHX","short_pith_number":"pith:ODXGDRPA","schema_version":"1.0","canonical_sha256":"70ee61c5e0fa1c3ddca7508940640e3deb271332b219f5733650ba855de25f3f","source":{"kind":"arxiv","id":"1811.11030","version":1},"attestation_state":"computed","paper":{"title":"Convexity in scientific collaboration networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DL","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Dalibor Fiala, Lovro \\v{S}ubelj, Luka Kronegger, Tadej Ciglari\\v{c}","submitted_at":"2018-11-27T14:44:38Z","abstract_excerpt":"Convexity in a network (graph) has been recently defined as a property of each of its subgraphs to include all shortest paths between the nodes of that subgraph. It can be measured on the scale [0, 1] with 1 being assigned to fully convex networks. The largest convex component of a graph that emerges after the removal of the least number of edges is called a convex skeleton. It is basically a tree of cliques, which has been shown to have many interesting features. In this article the notions of convexity and convex skeletons in the context of scientific collaboration networks are discussed. Mo"},"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":"1811.11030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-11-27T14:44:38Z","cross_cats_sorted":["cs.DL","physics.soc-ph"],"title_canon_sha256":"265e83911d639d660130362a8d51524cd5c5fc93628916d40576329de63ce233","abstract_canon_sha256":"fafd279c8ba52fe61b61e73f481711ccd0406a0e9ab43e03b08a259516412245"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:45.439539Z","signature_b64":"MT+KlrE20WlBwPCbLDUu8rLHfmktWDjfOOOkNisa7DGOWKXk4zqqtPq6aSnVXcMVi4jYpnfxmcHrpecP2D9qBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70ee61c5e0fa1c3ddca7508940640e3deb271332b219f5733650ba855de25f3f","last_reissued_at":"2026-05-17T23:59:45.439070Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:45.439070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convexity in scientific collaboration networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DL","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Dalibor Fiala, Lovro \\v{S}ubelj, Luka Kronegger, Tadej Ciglari\\v{c}","submitted_at":"2018-11-27T14:44:38Z","abstract_excerpt":"Convexity in a network (graph) has been recently defined as a property of each of its subgraphs to include all shortest paths between the nodes of that subgraph. It can be measured on the scale [0, 1] with 1 being assigned to fully convex networks. The largest convex component of a graph that emerges after the removal of the least number of edges is called a convex skeleton. It is basically a tree of cliques, which has been shown to have many interesting features. In this article the notions of convexity and convex skeletons in the context of scientific collaboration networks are discussed. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11030","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":"1811.11030","created_at":"2026-05-17T23:59:45.439144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11030v1","created_at":"2026-05-17T23:59:45.439144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11030","created_at":"2026-05-17T23:59:45.439144+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODXGDRPA7IOD","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODXGDRPA7IOD3XFH","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODXGDRPA","created_at":"2026-05-18T12:32:43.782077+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/ODXGDRPA7IOD3XFHKCEUAZAOHX","json":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX.json","graph_json":"https://pith.science/api/pith-number/ODXGDRPA7IOD3XFHKCEUAZAOHX/graph.json","events_json":"https://pith.science/api/pith-number/ODXGDRPA7IOD3XFHKCEUAZAOHX/events.json","paper":"https://pith.science/paper/ODXGDRPA"},"agent_actions":{"view_html":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX","download_json":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX.json","view_paper":"https://pith.science/paper/ODXGDRPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11030&json=true","fetch_graph":"https://pith.science/api/pith-number/ODXGDRPA7IOD3XFHKCEUAZAOHX/graph.json","fetch_events":"https://pith.science/api/pith-number/ODXGDRPA7IOD3XFHKCEUAZAOHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX/action/storage_attestation","attest_author":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX/action/author_attestation","sign_citation":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX/action/citation_signature","submit_replication":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX/action/replication_record"}},"created_at":"2026-05-17T23:59:45.439144+00:00","updated_at":"2026-05-17T23:59:45.439144+00:00"}