{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ODXGDRPA7IOD3XFHKCEUAZAOHX","short_pith_number":"pith:ODXGDRPA","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"},"canonical_sha256":"70ee61c5e0fa1c3ddca7508940640e3deb271332b219f5733650ba855de25f3f","source":{"kind":"arxiv","id":"1811.11030","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11030","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11030v1","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11030","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"pith_short_12","alias_value":"ODXGDRPA7IOD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ODXGDRPA7IOD3XFH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ODXGDRPA","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ODXGDRPA7IOD3XFHKCEUAZAOHX","target":"record","payload":{"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"},"canonical_sha256":"70ee61c5e0fa1c3ddca7508940640e3deb271332b219f5733650ba855de25f3f","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"},"source_kind":"arxiv","source_id":"1811.11030","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5G1eEaTK7gto0DMC+MVCdfrXDKIffmr3LCSnpDU7O69E7WUcRtIR+CZre+QSdFST7ixDUkstfFra66l8XOonBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:51:37.319021Z"},"content_sha256":"b071c5cda136d9b914ae332dffe7393adac9e5943d8d6f2a38e47877e90508f0","schema_version":"1.0","event_id":"sha256:b071c5cda136d9b914ae332dffe7393adac9e5943d8d6f2a38e47877e90508f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ODXGDRPA7IOD3XFHKCEUAZAOHX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNCaHBXoi5EzU9BxfMuMakXjM1T3DEWIPUE+5yzybO9j0xrfgfikeG7rTNChwER8GC/vGP5M+JNzUhPbAddMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:51:37.319383Z"},"content_sha256":"e3fd8c4771e56190f3c33f65e2812855623b6fd204e7c4a4c2e34c10c4bf22e1","schema_version":"1.0","event_id":"sha256:e3fd8c4771e56190f3c33f65e2812855623b6fd204e7c4a4c2e34c10c4bf22e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX/bundle.json","state_url":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T12:51:37Z","links":{"resolver":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX","bundle":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX/bundle.json","state":"https://pith.science/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODXGDRPA7IOD3XFHKCEUAZAOHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ODXGDRPA7IOD3XFHKCEUAZAOHX","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":"fafd279c8ba52fe61b61e73f481711ccd0406a0e9ab43e03b08a259516412245","cross_cats_sorted":["cs.DL","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-11-27T14:44:38Z","title_canon_sha256":"265e83911d639d660130362a8d51524cd5c5fc93628916d40576329de63ce233"},"schema_version":"1.0","source":{"id":"1811.11030","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11030","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11030v1","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11030","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"pith_short_12","alias_value":"ODXGDRPA7IOD","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ODXGDRPA7IOD3XFH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ODXGDRPA","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:e3fd8c4771e56190f3c33f65e2812855623b6fd204e7c4a4c2e34c10c4bf22e1","target":"graph","created_at":"2026-05-17T23:59:45Z","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":"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","authors_text":"Dalibor Fiala, Lovro \\v{S}ubelj, Luka Kronegger, Tadej Ciglari\\v{c}","cross_cats":["cs.DL","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-11-27T14:44:38Z","title":"Convexity in scientific collaboration networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11030","kind":"arxiv","version":1},"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:b071c5cda136d9b914ae332dffe7393adac9e5943d8d6f2a38e47877e90508f0","target":"record","created_at":"2026-05-17T23:59:45Z","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":"fafd279c8ba52fe61b61e73f481711ccd0406a0e9ab43e03b08a259516412245","cross_cats_sorted":["cs.DL","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-11-27T14:44:38Z","title_canon_sha256":"265e83911d639d660130362a8d51524cd5c5fc93628916d40576329de63ce233"},"schema_version":"1.0","source":{"id":"1811.11030","kind":"arxiv","version":1}},"canonical_sha256":"70ee61c5e0fa1c3ddca7508940640e3deb271332b219f5733650ba855de25f3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70ee61c5e0fa1c3ddca7508940640e3deb271332b219f5733650ba855de25f3f","first_computed_at":"2026-05-17T23:59:45.439070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:45.439070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MT+KlrE20WlBwPCbLDUu8rLHfmktWDjfOOOkNisa7DGOWKXk4zqqtPq6aSnVXcMVi4jYpnfxmcHrpecP2D9qBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:45.439539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11030","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b071c5cda136d9b914ae332dffe7393adac9e5943d8d6f2a38e47877e90508f0","sha256:e3fd8c4771e56190f3c33f65e2812855623b6fd204e7c4a4c2e34c10c4bf22e1"],"state_sha256":"18844f530a5974c60dee3cc1f3744e4a1b2298fbc762344687eafce46ef4da61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2RHQkpuFlMZDszleh/BYExh/T2CRUaCbWcJPgOJiLcmgKnxX5/pzGcCsnspK3FQeFQZZxqgElwA003ZC1JqMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:51:37.321349Z","bundle_sha256":"3bb1a4183cd542134814e01fe4a0588fbf64119d322716ddd1a4d731ca1549bb"}}