{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5ZFVPGTSIEPX7AGP6GSQ7FG23M","short_pith_number":"pith:5ZFVPGTS","canonical_record":{"source":{"id":"1611.06135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-18T15:58:10Z","cross_cats_sorted":[],"title_canon_sha256":"8dc2ea9eefa6d4e028a27cdec0e1fe94e5cb979091b555435f650bb29d05c534","abstract_canon_sha256":"977df609274205658b9883c8f2fb3301ba76bfc45d87391365ad0188555c16e7"},"schema_version":"1.0"},"canonical_sha256":"ee4b579a72411f7f80cff1a50f94dadb2b67467b305d3518cfed1d69a3eee1f6","source":{"kind":"arxiv","id":"1611.06135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06135","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06135v1","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06135","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"pith_short_12","alias_value":"5ZFVPGTSIEPX","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5ZFVPGTSIEPX7AGP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5ZFVPGTS","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5ZFVPGTSIEPX7AGP6GSQ7FG23M","target":"record","payload":{"canonical_record":{"source":{"id":"1611.06135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-18T15:58:10Z","cross_cats_sorted":[],"title_canon_sha256":"8dc2ea9eefa6d4e028a27cdec0e1fe94e5cb979091b555435f650bb29d05c534","abstract_canon_sha256":"977df609274205658b9883c8f2fb3301ba76bfc45d87391365ad0188555c16e7"},"schema_version":"1.0"},"canonical_sha256":"ee4b579a72411f7f80cff1a50f94dadb2b67467b305d3518cfed1d69a3eee1f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:42.993609Z","signature_b64":"DRQZnOjUe9Vk5f7c81GlOr1Ir8RXBzAehJYoGNYg16Kxcg1cfaW+iskaJeapxOnqfuSn8NIcwejbNZUnv14jAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee4b579a72411f7f80cff1a50f94dadb2b67467b305d3518cfed1d69a3eee1f6","last_reissued_at":"2026-05-18T00:57:42.993199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:42.993199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.06135","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-18T00:57:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UypAiSeNKKylbl5/7tQTTYUASA9tXQsu2qJ9yriDJnMCF7Q1eMBBm7RGPLM7+ofkkpKEbDvvgvwibwbloF1jCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:14:05.493233Z"},"content_sha256":"c780909f5f93a8f3c689274ad78f9956be0854865ac66cad7ef514d0abf75d7c","schema_version":"1.0","event_id":"sha256:c780909f5f93a8f3c689274ad78f9956be0854865ac66cad7ef514d0abf75d7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5ZFVPGTSIEPX7AGP6GSQ7FG23M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large Values of the Clustering Coefficient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Irene Heinrich, Michael Gentner, Simon J\\\"ager","submitted_at":"2016-11-18T15:58:10Z","abstract_excerpt":"A prominent parameter in the context of network analysis, originally proposed by Watts and Strogatz (Collective dynamics of `small-world' networks, Nature 393 (1998) 440-442), is the clustering coefficient of a graph $G$. It is defined as the arithmetic mean of the clustering coefficients of its vertices, where the clustering coefficient of a vertex $u$ of $G$ is the relative density $m(G[N_G(u)])/{d_G(u)\\choose 2}$ of its neighborhood if $d_G(u)$ is at least $2$, and $0$ otherwise. It is unknown which graphs maximize the clustering coefficient among all connected graphs of given order and siz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06135","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-18T00:57:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ek8IqsUQBzUqhLCpr7h4dmyAB+r5hUf6naax4i8c3AFvIM60r4lZBWu5Q5ztmVJwcGM8E+vhYQ4BgOOfzACWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:14:05.493907Z"},"content_sha256":"5ecb1975e2af9aac7026953271f1fee8750a3ba90c211f4bb4844b80476c7989","schema_version":"1.0","event_id":"sha256:5ecb1975e2af9aac7026953271f1fee8750a3ba90c211f4bb4844b80476c7989"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZFVPGTSIEPX7AGP6GSQ7FG23M/bundle.json","state_url":"https://pith.science/pith/5ZFVPGTSIEPX7AGP6GSQ7FG23M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZFVPGTSIEPX7AGP6GSQ7FG23M/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-11T07:14:05Z","links":{"resolver":"https://pith.science/pith/5ZFVPGTSIEPX7AGP6GSQ7FG23M","bundle":"https://pith.science/pith/5ZFVPGTSIEPX7AGP6GSQ7FG23M/bundle.json","state":"https://pith.science/pith/5ZFVPGTSIEPX7AGP6GSQ7FG23M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZFVPGTSIEPX7AGP6GSQ7FG23M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5ZFVPGTSIEPX7AGP6GSQ7FG23M","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":"977df609274205658b9883c8f2fb3301ba76bfc45d87391365ad0188555c16e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-18T15:58:10Z","title_canon_sha256":"8dc2ea9eefa6d4e028a27cdec0e1fe94e5cb979091b555435f650bb29d05c534"},"schema_version":"1.0","source":{"id":"1611.06135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06135","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06135v1","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06135","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"pith_short_12","alias_value":"5ZFVPGTSIEPX","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5ZFVPGTSIEPX7AGP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5ZFVPGTS","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:5ecb1975e2af9aac7026953271f1fee8750a3ba90c211f4bb4844b80476c7989","target":"graph","created_at":"2026-05-18T00:57:42Z","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 prominent parameter in the context of network analysis, originally proposed by Watts and Strogatz (Collective dynamics of `small-world' networks, Nature 393 (1998) 440-442), is the clustering coefficient of a graph $G$. It is defined as the arithmetic mean of the clustering coefficients of its vertices, where the clustering coefficient of a vertex $u$ of $G$ is the relative density $m(G[N_G(u)])/{d_G(u)\\choose 2}$ of its neighborhood if $d_G(u)$ is at least $2$, and $0$ otherwise. It is unknown which graphs maximize the clustering coefficient among all connected graphs of given order and siz","authors_text":"Dieter Rautenbach, Irene Heinrich, Michael Gentner, Simon J\\\"ager","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-18T15:58:10Z","title":"Large Values of the Clustering Coefficient"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06135","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:c780909f5f93a8f3c689274ad78f9956be0854865ac66cad7ef514d0abf75d7c","target":"record","created_at":"2026-05-18T00:57:42Z","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":"977df609274205658b9883c8f2fb3301ba76bfc45d87391365ad0188555c16e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-18T15:58:10Z","title_canon_sha256":"8dc2ea9eefa6d4e028a27cdec0e1fe94e5cb979091b555435f650bb29d05c534"},"schema_version":"1.0","source":{"id":"1611.06135","kind":"arxiv","version":1}},"canonical_sha256":"ee4b579a72411f7f80cff1a50f94dadb2b67467b305d3518cfed1d69a3eee1f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee4b579a72411f7f80cff1a50f94dadb2b67467b305d3518cfed1d69a3eee1f6","first_computed_at":"2026-05-18T00:57:42.993199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:42.993199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DRQZnOjUe9Vk5f7c81GlOr1Ir8RXBzAehJYoGNYg16Kxcg1cfaW+iskaJeapxOnqfuSn8NIcwejbNZUnv14jAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:42.993609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c780909f5f93a8f3c689274ad78f9956be0854865ac66cad7ef514d0abf75d7c","sha256:5ecb1975e2af9aac7026953271f1fee8750a3ba90c211f4bb4844b80476c7989"],"state_sha256":"3280125b9f1a004bc98295ef60f5c52add6562ef01be3fca4ee53d5aa73c3bb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/W/4udTf+cjqg92TUPphjdoMRl/eWT4m4BtYxkAI222bleaKoTlKu0f65hG+QJjaGWAzi0oWQOS22iPah9yECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:14:05.498407Z","bundle_sha256":"b14766512cfe15760d4266280f1f56104ae055d0b882283430bd0ef28a833170"}}