{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HPK657LK2JIG2FCB6PMVJC76JI","short_pith_number":"pith:HPK657LK","canonical_record":{"source":{"id":"1806.08303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-21T16:02:24Z","cross_cats_sorted":[],"title_canon_sha256":"6729e565defe7e00dc8e309b67dbbe0d0a063a4b993ebe9b3558fdafc42b542e","abstract_canon_sha256":"834936603ae4ad7d8e95008e2843132c2803ddf28a53c64b08260c124e88f9af"},"schema_version":"1.0"},"canonical_sha256":"3bd5eefd6ad2506d1441f3d9548bfe4a39dae10bf28a4ba3f7c84aa4a9aa69ca","source":{"kind":"arxiv","id":"1806.08303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08303","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08303v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08303","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"HPK657LK2JIG","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HPK657LK2JIG2FCB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HPK657LK","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HPK657LK2JIG2FCB6PMVJC76JI","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-21T16:02:24Z","cross_cats_sorted":[],"title_canon_sha256":"6729e565defe7e00dc8e309b67dbbe0d0a063a4b993ebe9b3558fdafc42b542e","abstract_canon_sha256":"834936603ae4ad7d8e95008e2843132c2803ddf28a53c64b08260c124e88f9af"},"schema_version":"1.0"},"canonical_sha256":"3bd5eefd6ad2506d1441f3d9548bfe4a39dae10bf28a4ba3f7c84aa4a9aa69ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:41.434135Z","signature_b64":"0jMBMOLgpbejgMohDjlLsryRIcGm2xmotYotuIKib4ZLwWG6cE02eDJPEFiob2RopDMn+AcbK2qunjX/5+z5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bd5eefd6ad2506d1441f3d9548bfe4a39dae10bf28a4ba3f7c84aa4a9aa69ca","last_reissued_at":"2026-05-18T00:12:41.433517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:41.433517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08303","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:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dTwLNrFplrlcuFMF9At944QfzEZYeGkUPyewZBQ8Ya/pyYALi8gkujtY7cR1ufmvSPG3VEQvxPTblrCBiabAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:10:00.259734Z"},"content_sha256":"bb21bd1c3ef904b07e8d3e7060dd8916ebb85d83972962afc8bb2e336bd6e249","schema_version":"1.0","event_id":"sha256:bb21bd1c3ef904b07e8d3e7060dd8916ebb85d83972962afc8bb2e336bd6e249"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HPK657LK2JIG2FCB6PMVJC76JI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Notes on Spreads of Degrees in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","submitted_at":"2018-06-21T16:02:24Z","abstract_excerpt":"Perhaps the very first elementary exercise one encounters in graph theory is the result that any graph on at least two vertices must have at least two vertices with the same degree. There are various ways in which this result can be non-trivially generalised. For example, one can interpret this result as saying that in any graph $G$ on at least two vertices there is a set $B$ of at least two vertices such that the difference between the largest and the smallest degrees (in $G$) of the vertices of $B$ is zero. In this vein we make the following definition. For any $B\\subset V(G)$, let the sprea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08303","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:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTchtDkol02Oorisw96J1Q5ZdF0UfOCCz1YDr1nRmFDyeC/uqh4K9lhUOoAglGxAUEivb3iqduqEHdHMv47wDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:10:00.260079Z"},"content_sha256":"2d9d2334187a5f06a41c295a3950e7616f01457605ed6fdeac9e300013e8c5bb","schema_version":"1.0","event_id":"sha256:2d9d2334187a5f06a41c295a3950e7616f01457605ed6fdeac9e300013e8c5bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPK657LK2JIG2FCB6PMVJC76JI/bundle.json","state_url":"https://pith.science/pith/HPK657LK2JIG2FCB6PMVJC76JI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPK657LK2JIG2FCB6PMVJC76JI/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-25T11:10:00Z","links":{"resolver":"https://pith.science/pith/HPK657LK2JIG2FCB6PMVJC76JI","bundle":"https://pith.science/pith/HPK657LK2JIG2FCB6PMVJC76JI/bundle.json","state":"https://pith.science/pith/HPK657LK2JIG2FCB6PMVJC76JI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPK657LK2JIG2FCB6PMVJC76JI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HPK657LK2JIG2FCB6PMVJC76JI","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":"834936603ae4ad7d8e95008e2843132c2803ddf28a53c64b08260c124e88f9af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-21T16:02:24Z","title_canon_sha256":"6729e565defe7e00dc8e309b67dbbe0d0a063a4b993ebe9b3558fdafc42b542e"},"schema_version":"1.0","source":{"id":"1806.08303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08303","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08303v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08303","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"HPK657LK2JIG","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HPK657LK2JIG2FCB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HPK657LK","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:2d9d2334187a5f06a41c295a3950e7616f01457605ed6fdeac9e300013e8c5bb","target":"graph","created_at":"2026-05-18T00:12:41Z","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":"Perhaps the very first elementary exercise one encounters in graph theory is the result that any graph on at least two vertices must have at least two vertices with the same degree. There are various ways in which this result can be non-trivially generalised. For example, one can interpret this result as saying that in any graph $G$ on at least two vertices there is a set $B$ of at least two vertices such that the difference between the largest and the smallest degrees (in $G$) of the vertices of $B$ is zero. In this vein we make the following definition. For any $B\\subset V(G)$, let the sprea","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-21T16:02:24Z","title":"Notes on Spreads of Degrees in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08303","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:bb21bd1c3ef904b07e8d3e7060dd8916ebb85d83972962afc8bb2e336bd6e249","target":"record","created_at":"2026-05-18T00:12:41Z","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":"834936603ae4ad7d8e95008e2843132c2803ddf28a53c64b08260c124e88f9af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-21T16:02:24Z","title_canon_sha256":"6729e565defe7e00dc8e309b67dbbe0d0a063a4b993ebe9b3558fdafc42b542e"},"schema_version":"1.0","source":{"id":"1806.08303","kind":"arxiv","version":1}},"canonical_sha256":"3bd5eefd6ad2506d1441f3d9548bfe4a39dae10bf28a4ba3f7c84aa4a9aa69ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bd5eefd6ad2506d1441f3d9548bfe4a39dae10bf28a4ba3f7c84aa4a9aa69ca","first_computed_at":"2026-05-18T00:12:41.433517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:41.433517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0jMBMOLgpbejgMohDjlLsryRIcGm2xmotYotuIKib4ZLwWG6cE02eDJPEFiob2RopDMn+AcbK2qunjX/5+z5Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:41.434135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb21bd1c3ef904b07e8d3e7060dd8916ebb85d83972962afc8bb2e336bd6e249","sha256:2d9d2334187a5f06a41c295a3950e7616f01457605ed6fdeac9e300013e8c5bb"],"state_sha256":"ed44a1de10356bff4df5f919f7cccf4ab4e5226e720e81be2ea5609928f49a38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXAKckZDqYFTQmcxdRnTJIHUScj1P3UBa2dK0v4TJoUoaEBj6jrv9iD+JT7RGzN14rQbCepmQut5Oljwzt5SDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:10:00.262052Z","bundle_sha256":"6253bbb71ecc1945f5633b86369337f9373fa930603f61835c03614d514a16da"}}