{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RHZAKIQGUULK2ROQA7FWIK2VL3","short_pith_number":"pith:RHZAKIQG","schema_version":"1.0","canonical_sha256":"89f2052206a516ad45d007cb642b555ee0202bd41eb6b305ba01d0221608254b","source":{"kind":"arxiv","id":"1709.00255","version":4},"attestation_state":"computed","paper":{"title":"Convex skeletons of complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Lovro \\v{S}ubelj","submitted_at":"2017-09-01T11:36:17Z","abstract_excerpt":"A convex network can be defined as a network such that every connected induced subgraph includes all the shortest paths between its nodes. Fully convex network would therefore be a collection of cliques stitched together in a tree. In this paper, we study the largest high-convexity part of empirical networks obtained by removing the least number of edges, which we call a convex skeleton. A convex skeleton is a generalisation of a network spanning tree in which each edge can be replaced by a clique of arbitrary size. We present different approaches for extracting convex skeletons and apply them"},"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.00255","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-01T11:36:17Z","cross_cats_sorted":["math.MG","physics.soc-ph"],"title_canon_sha256":"1d4127cf80f62becf36dcbb35c49881e5341543f85beb6cbea42f831925e9171","abstract_canon_sha256":"c81a4efac1c0c404dea0a3a811af7f20d13e8e6360b9fb9c351babe1e9e9e407"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:03.367560Z","signature_b64":"c5W+ifHEdSMBMZuEAhI032+V0dZAS20EMdOa7fJD0fMeZ/+gDlx5XBu4WbyZ+GSViux3d0eBn7heuQ2gefnRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89f2052206a516ad45d007cb642b555ee0202bd41eb6b305ba01d0221608254b","last_reissued_at":"2026-05-18T00:08:03.367107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:03.367107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex skeletons of complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Lovro \\v{S}ubelj","submitted_at":"2017-09-01T11:36:17Z","abstract_excerpt":"A convex network can be defined as a network such that every connected induced subgraph includes all the shortest paths between its nodes. Fully convex network would therefore be a collection of cliques stitched together in a tree. In this paper, we study the largest high-convexity part of empirical networks obtained by removing the least number of edges, which we call a convex skeleton. A convex skeleton is a generalisation of a network spanning tree in which each edge can be replaced by a clique of arbitrary size. We present different approaches for extracting convex skeletons and apply them"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00255","kind":"arxiv","version":4},"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.00255","created_at":"2026-05-18T00:08:03.367173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00255v4","created_at":"2026-05-18T00:08:03.367173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00255","created_at":"2026-05-18T00:08:03.367173+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHZAKIQGUULK","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHZAKIQGUULK2ROQ","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHZAKIQG","created_at":"2026-05-18T12:31:39.905425+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/RHZAKIQGUULK2ROQA7FWIK2VL3","json":"https://pith.science/pith/RHZAKIQGUULK2ROQA7FWIK2VL3.json","graph_json":"https://pith.science/api/pith-number/RHZAKIQGUULK2ROQA7FWIK2VL3/graph.json","events_json":"https://pith.science/api/pith-number/RHZAKIQGUULK2ROQA7FWIK2VL3/events.json","paper":"https://pith.science/paper/RHZAKIQG"},"agent_actions":{"view_html":"https://pith.science/pith/RHZAKIQGUULK2ROQA7FWIK2VL3","download_json":"https://pith.science/pith/RHZAKIQGUULK2ROQA7FWIK2VL3.json","view_paper":"https://pith.science/paper/RHZAKIQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00255&json=true","fetch_graph":"https://pith.science/api/pith-number/RHZAKIQGUULK2ROQA7FWIK2VL3/graph.json","fetch_events":"https://pith.science/api/pith-number/RHZAKIQGUULK2ROQA7FWIK2VL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHZAKIQGUULK2ROQA7FWIK2VL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHZAKIQGUULK2ROQA7FWIK2VL3/action/storage_attestation","attest_author":"https://pith.science/pith/RHZAKIQGUULK2ROQA7FWIK2VL3/action/author_attestation","sign_citation":"https://pith.science/pith/RHZAKIQGUULK2ROQA7FWIK2VL3/action/citation_signature","submit_replication":"https://pith.science/pith/RHZAKIQGUULK2ROQA7FWIK2VL3/action/replication_record"}},"created_at":"2026-05-18T00:08:03.367173+00:00","updated_at":"2026-05-18T00:08:03.367173+00:00"}