{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RHZAKIQGUULK2ROQA7FWIK2VL3","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":"c81a4efac1c0c404dea0a3a811af7f20d13e8e6360b9fb9c351babe1e9e9e407","cross_cats_sorted":["math.MG","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-01T11:36:17Z","title_canon_sha256":"1d4127cf80f62becf36dcbb35c49881e5341543f85beb6cbea42f831925e9171"},"schema_version":"1.0","source":{"id":"1709.00255","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00255","created_at":"2026-05-18T00:08:03Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00255v4","created_at":"2026-05-18T00:08:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00255","created_at":"2026-05-18T00:08:03Z"},{"alias_kind":"pith_short_12","alias_value":"RHZAKIQGUULK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RHZAKIQGUULK2ROQ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RHZAKIQG","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:c0698661c432bd4ceaeb04ae6f68a90bfac2d0b36b2cf18a31dacdbc6d0d1be5","target":"graph","created_at":"2026-05-18T00:08:03Z","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":"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","authors_text":"Lovro \\v{S}ubelj","cross_cats":["math.MG","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-01T11:36:17Z","title":"Convex skeletons of complex networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00255","kind":"arxiv","version":4},"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:fa328ba605fb3fddb36d2819c1a347fdde14c81e3761fac8a79e3f5068c981bb","target":"record","created_at":"2026-05-18T00:08:03Z","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":"c81a4efac1c0c404dea0a3a811af7f20d13e8e6360b9fb9c351babe1e9e9e407","cross_cats_sorted":["math.MG","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-01T11:36:17Z","title_canon_sha256":"1d4127cf80f62becf36dcbb35c49881e5341543f85beb6cbea42f831925e9171"},"schema_version":"1.0","source":{"id":"1709.00255","kind":"arxiv","version":4}},"canonical_sha256":"89f2052206a516ad45d007cb642b555ee0202bd41eb6b305ba01d0221608254b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89f2052206a516ad45d007cb642b555ee0202bd41eb6b305ba01d0221608254b","first_computed_at":"2026-05-18T00:08:03.367107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:03.367107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c5W+ifHEdSMBMZuEAhI032+V0dZAS20EMdOa7fJD0fMeZ/+gDlx5XBu4WbyZ+GSViux3d0eBn7heuQ2gefnRDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:03.367560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00255","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa328ba605fb3fddb36d2819c1a347fdde14c81e3761fac8a79e3f5068c981bb","sha256:c0698661c432bd4ceaeb04ae6f68a90bfac2d0b36b2cf18a31dacdbc6d0d1be5"],"state_sha256":"8669750b5609ba9e7ccfaa0ed20b45e18947a6c28c61fbbc7a068c0e9a4776d8"}