{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YGMEQ2MIPRJEYQKECLV6QBG4AA","short_pith_number":"pith:YGMEQ2MI","canonical_record":{"source":{"id":"1811.02747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T03:49:30Z","cross_cats_sorted":[],"title_canon_sha256":"bc84dad51a661f505bdd2f970474cdc3178f90f937c91a70ec5d6d7885b4be40","abstract_canon_sha256":"8a3ddd8a722de0ce6c14b12019fd76d6a4190a59d8691e4e47c0c4e252809d65"},"schema_version":"1.0"},"canonical_sha256":"c1984869887c524c414412ebe804dc000fa3a04a50b8fa4aeb8c9726efaee055","source":{"kind":"arxiv","id":"1811.02747","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02747","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02747v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02747","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"YGMEQ2MIPRJE","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YGMEQ2MIPRJEYQKE","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YGMEQ2MI","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YGMEQ2MIPRJEYQKECLV6QBG4AA","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T03:49:30Z","cross_cats_sorted":[],"title_canon_sha256":"bc84dad51a661f505bdd2f970474cdc3178f90f937c91a70ec5d6d7885b4be40","abstract_canon_sha256":"8a3ddd8a722de0ce6c14b12019fd76d6a4190a59d8691e4e47c0c4e252809d65"},"schema_version":"1.0"},"canonical_sha256":"c1984869887c524c414412ebe804dc000fa3a04a50b8fa4aeb8c9726efaee055","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.890987Z","signature_b64":"xHUEGAl+Xf1ZO3+H4HI5BUA3wQYe3cgc16g+l0cxCRI7Q0NAXan9vUIoTs3mSpwL/h9Cojilg+7oXp7ZWso9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1984869887c524c414412ebe804dc000fa3a04a50b8fa4aeb8c9726efaee055","last_reissued_at":"2026-05-18T00:01:20.890451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.890451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02747","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:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SbRYZRSE2/BlXDaJ3KCnY1uB5GBBuryQLqWAGNk6qJG31ysKRtrumE1M+Wlj9nYZkbRv9sz6eXnSGUEx81VRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:11:59.157024Z"},"content_sha256":"7f07a4f5b9568ce36cd21d1cfa14a642d6b8d8a2a40f397c904db9c69f33cf89","schema_version":"1.0","event_id":"sha256:7f07a4f5b9568ce36cd21d1cfa14a642d6b8d8a2a40f397c904db9c69f33cf89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YGMEQ2MIPRJEYQKECLV6QBG4AA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the degree pairs of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chia-an Liu, Chih-wen Weng, Yu-Pei Huang","submitted_at":"2018-11-07T03:49:30Z","abstract_excerpt":"Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degrees of the vertices which are adjacent to i. The sequence of pairs (d_i, m_i) is called the sequence of degree pairs of G. We provide some necessary conditions for a sequence of real pairs (a_i, b_i) of length n to be the degree pairs of a graph of order n. A graph G is called pseudo k-regular if m_i=k for every vertex i while d_i is not a constant. Let N(k) denote the minimum number of vertices in a pseudo k-regular "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02747","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:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8QsFm3SNTwGTyjKrduHBkvGPQ7aaQ7WEoBP2sVVZhcq1S6uVu/dx8EEnEgdFCb0FGBeMiubHK0LeDZ6ykVFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:11:59.157379Z"},"content_sha256":"0cbd446b905978eb25702c132814ebca9239519c17f94f62abb492ab559a5a78","schema_version":"1.0","event_id":"sha256:0cbd446b905978eb25702c132814ebca9239519c17f94f62abb492ab559a5a78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA/bundle.json","state_url":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA/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-08T22:11:59Z","links":{"resolver":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA","bundle":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA/bundle.json","state":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YGMEQ2MIPRJEYQKECLV6QBG4AA","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":"8a3ddd8a722de0ce6c14b12019fd76d6a4190a59d8691e4e47c0c4e252809d65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T03:49:30Z","title_canon_sha256":"bc84dad51a661f505bdd2f970474cdc3178f90f937c91a70ec5d6d7885b4be40"},"schema_version":"1.0","source":{"id":"1811.02747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02747","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02747v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02747","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"YGMEQ2MIPRJE","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YGMEQ2MIPRJEYQKE","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YGMEQ2MI","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:0cbd446b905978eb25702c132814ebca9239519c17f94f62abb492ab559a5a78","target":"graph","created_at":"2026-05-18T00:01:20Z","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":"Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degrees of the vertices which are adjacent to i. The sequence of pairs (d_i, m_i) is called the sequence of degree pairs of G. We provide some necessary conditions for a sequence of real pairs (a_i, b_i) of length n to be the degree pairs of a graph of order n. A graph G is called pseudo k-regular if m_i=k for every vertex i while d_i is not a constant. Let N(k) denote the minimum number of vertices in a pseudo k-regular ","authors_text":"Chia-an Liu, Chih-wen Weng, Yu-Pei Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T03:49:30Z","title":"On the degree pairs of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02747","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:7f07a4f5b9568ce36cd21d1cfa14a642d6b8d8a2a40f397c904db9c69f33cf89","target":"record","created_at":"2026-05-18T00:01:20Z","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":"8a3ddd8a722de0ce6c14b12019fd76d6a4190a59d8691e4e47c0c4e252809d65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T03:49:30Z","title_canon_sha256":"bc84dad51a661f505bdd2f970474cdc3178f90f937c91a70ec5d6d7885b4be40"},"schema_version":"1.0","source":{"id":"1811.02747","kind":"arxiv","version":1}},"canonical_sha256":"c1984869887c524c414412ebe804dc000fa3a04a50b8fa4aeb8c9726efaee055","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1984869887c524c414412ebe804dc000fa3a04a50b8fa4aeb8c9726efaee055","first_computed_at":"2026-05-18T00:01:20.890451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:20.890451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xHUEGAl+Xf1ZO3+H4HI5BUA3wQYe3cgc16g+l0cxCRI7Q0NAXan9vUIoTs3mSpwL/h9Cojilg+7oXp7ZWso9AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:20.890987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f07a4f5b9568ce36cd21d1cfa14a642d6b8d8a2a40f397c904db9c69f33cf89","sha256:0cbd446b905978eb25702c132814ebca9239519c17f94f62abb492ab559a5a78"],"state_sha256":"7d556b0f998366b90e1cd57829bd9f426231957e9ef7efe9203bc8fbc8a94037"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXdWNM9ocfroo46qoGyq/miRdBwoCzLXkB8E+vQPWfZQIBN90GfuEbokLpoxXxMVHY5JoU2Gc/MGLr2Y1XGjAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:11:59.159249Z","bundle_sha256":"7a586928a95f6b0b2bb786887a88a804e5f946a3b0321c69b58e3263529b8c5b"}}