{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EFUADHI4LNJDOBHGX46BRNQMCV","short_pith_number":"pith:EFUADHI4","schema_version":"1.0","canonical_sha256":"2168019d1c5b523704e6bf3c18b60c1554fd1c15b7dc0a19f8f63ea8ce0cef26","source":{"kind":"arxiv","id":"1511.01035","version":4},"attestation_state":"computed","paper":{"title":"On the Number of Non-zero Elements of Joint Degree Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eva Czabarka, Johannes Rauh, Kayvan Sadeghi, Laszlo A Szekely, Taylor Short","submitted_at":"2015-11-03T19:08:51Z","abstract_excerpt":"Joint degree vectors give the number of edges between vertices of degree $i$ and degree $j$ for $1\\le i\\le j\\le n-1$ in an $n$-vertex graph. We find lower and upper bounds for the maximum number of nonzero elements in a joint degree vector as a function of $n$. This provides an upper bound on the number of estimable parameters in the exponential random graph model with bidegree-distribution as its sufficient statistics."},"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":"1511.01035","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-03T19:08:51Z","cross_cats_sorted":[],"title_canon_sha256":"a9fbdcefa912447ec3aac9391ce26fb02b8b45e3a5f7935d006fab7b5daa42e3","abstract_canon_sha256":"8cd2d18496b560c6edd0d78846df07a28d97f35eb7f2203ef72469e6bd955e97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:12.558206Z","signature_b64":"Rc0DYITRkX6kdIrOvfyxVXV16wptaqapgIDe+LkaitDA0sYvi8Fbt2Qoaqxd4QcI24reyncmSqEsPzZdhlevAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2168019d1c5b523704e6bf3c18b60c1554fd1c15b7dc0a19f8f63ea8ce0cef26","last_reissued_at":"2026-05-18T00:50:12.557658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:12.557658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Number of Non-zero Elements of Joint Degree Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eva Czabarka, Johannes Rauh, Kayvan Sadeghi, Laszlo A Szekely, Taylor Short","submitted_at":"2015-11-03T19:08:51Z","abstract_excerpt":"Joint degree vectors give the number of edges between vertices of degree $i$ and degree $j$ for $1\\le i\\le j\\le n-1$ in an $n$-vertex graph. We find lower and upper bounds for the maximum number of nonzero elements in a joint degree vector as a function of $n$. This provides an upper bound on the number of estimable parameters in the exponential random graph model with bidegree-distribution as its sufficient statistics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01035","kind":"arxiv","version":4},"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":"1511.01035","created_at":"2026-05-18T00:50:12.557748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01035v4","created_at":"2026-05-18T00:50:12.557748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01035","created_at":"2026-05-18T00:50:12.557748+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFUADHI4LNJD","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFUADHI4LNJDOBHG","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFUADHI4","created_at":"2026-05-18T12:29:19.899920+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/EFUADHI4LNJDOBHGX46BRNQMCV","json":"https://pith.science/pith/EFUADHI4LNJDOBHGX46BRNQMCV.json","graph_json":"https://pith.science/api/pith-number/EFUADHI4LNJDOBHGX46BRNQMCV/graph.json","events_json":"https://pith.science/api/pith-number/EFUADHI4LNJDOBHGX46BRNQMCV/events.json","paper":"https://pith.science/paper/EFUADHI4"},"agent_actions":{"view_html":"https://pith.science/pith/EFUADHI4LNJDOBHGX46BRNQMCV","download_json":"https://pith.science/pith/EFUADHI4LNJDOBHGX46BRNQMCV.json","view_paper":"https://pith.science/paper/EFUADHI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01035&json=true","fetch_graph":"https://pith.science/api/pith-number/EFUADHI4LNJDOBHGX46BRNQMCV/graph.json","fetch_events":"https://pith.science/api/pith-number/EFUADHI4LNJDOBHGX46BRNQMCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFUADHI4LNJDOBHGX46BRNQMCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFUADHI4LNJDOBHGX46BRNQMCV/action/storage_attestation","attest_author":"https://pith.science/pith/EFUADHI4LNJDOBHGX46BRNQMCV/action/author_attestation","sign_citation":"https://pith.science/pith/EFUADHI4LNJDOBHGX46BRNQMCV/action/citation_signature","submit_replication":"https://pith.science/pith/EFUADHI4LNJDOBHGX46BRNQMCV/action/replication_record"}},"created_at":"2026-05-18T00:50:12.557748+00:00","updated_at":"2026-05-18T00:50:12.557748+00:00"}