{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YGMEQ2MIPRJEYQKECLV6QBG4AA","short_pith_number":"pith:YGMEQ2MI","schema_version":"1.0","canonical_sha256":"c1984869887c524c414412ebe804dc000fa3a04a50b8fa4aeb8c9726efaee055","source":{"kind":"arxiv","id":"1811.02747","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.02747","created_at":"2026-05-18T00:01:20.890519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02747v1","created_at":"2026-05-18T00:01:20.890519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02747","created_at":"2026-05-18T00:01:20.890519+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGMEQ2MIPRJE","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGMEQ2MIPRJEYQKE","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGMEQ2MI","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA","json":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA.json","graph_json":"https://pith.science/api/pith-number/YGMEQ2MIPRJEYQKECLV6QBG4AA/graph.json","events_json":"https://pith.science/api/pith-number/YGMEQ2MIPRJEYQKECLV6QBG4AA/events.json","paper":"https://pith.science/paper/YGMEQ2MI"},"agent_actions":{"view_html":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA","download_json":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA.json","view_paper":"https://pith.science/paper/YGMEQ2MI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02747&json=true","fetch_graph":"https://pith.science/api/pith-number/YGMEQ2MIPRJEYQKECLV6QBG4AA/graph.json","fetch_events":"https://pith.science/api/pith-number/YGMEQ2MIPRJEYQKECLV6QBG4AA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA/action/storage_attestation","attest_author":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA/action/author_attestation","sign_citation":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA/action/citation_signature","submit_replication":"https://pith.science/pith/YGMEQ2MIPRJEYQKECLV6QBG4AA/action/replication_record"}},"created_at":"2026-05-18T00:01:20.890519+00:00","updated_at":"2026-05-18T00:01:20.890519+00:00"}