{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HCEHYO4UVU3KWAJVTI7PCELBPQ","short_pith_number":"pith:HCEHYO4U","schema_version":"1.0","canonical_sha256":"38887c3b94ad36ab01359a3ef111617c233f362420e15fb6c65b55c3afa3a9e0","source":{"kind":"arxiv","id":"1103.0080","version":3},"attestation_state":"computed","paper":{"title":"Counting loopy graphs with given degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Catherine Greenhill","submitted_at":"2011-03-01T04:46:32Z","abstract_excerpt":"Let d=(d_1,d_2,..., d_n) be a vector of non-negative integers. We study the number of symmetric 0-1 matrices whose row sum vector equals d. While previous work has focussed on the case of zero diagonal, we allow diagonal entries to equal 1. When forming the row sum, each diagonal entry is multiplied by a factor of D, where D is 1 or 2. The case D=1 corresponds to enumeration by the usual row sum of matrices. The case D=2 corresponds to enumeration by degree sequence of undirected graphs with loops but no repeated edges, due to the convention that a loop contributes 2 to the degree of its incid"},"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":"1103.0080","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-01T04:46:32Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"19ac1eda0f3d3fb88a399179426f1ba7dac5a8592eb3dbfa627dcb2e41ece584","abstract_canon_sha256":"e3c20b092585cb081425a391aeadda639f958be0ca2a96d501d5383059ffbb5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:28.469030Z","signature_b64":"LDgKQAq9IsoaGguxhJP4aB55YVXJZ8ijqx5n/UmLe1mfXzEoUhDX2R8ljWx7RgdR+K7KZkdDEJ0RKMmO9iedAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38887c3b94ad36ab01359a3ef111617c233f362420e15fb6c65b55c3afa3a9e0","last_reissued_at":"2026-05-18T04:00:28.468603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:28.468603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting loopy graphs with given degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Catherine Greenhill","submitted_at":"2011-03-01T04:46:32Z","abstract_excerpt":"Let d=(d_1,d_2,..., d_n) be a vector of non-negative integers. We study the number of symmetric 0-1 matrices whose row sum vector equals d. While previous work has focussed on the case of zero diagonal, we allow diagonal entries to equal 1. When forming the row sum, each diagonal entry is multiplied by a factor of D, where D is 1 or 2. The case D=1 corresponds to enumeration by the usual row sum of matrices. The case D=2 corresponds to enumeration by degree sequence of undirected graphs with loops but no repeated edges, due to the convention that a loop contributes 2 to the degree of its incid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0080","kind":"arxiv","version":3},"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":"1103.0080","created_at":"2026-05-18T04:00:28.468660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0080v3","created_at":"2026-05-18T04:00:28.468660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0080","created_at":"2026-05-18T04:00:28.468660+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCEHYO4UVU3K","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCEHYO4UVU3KWAJV","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCEHYO4U","created_at":"2026-05-18T12:26:30.835961+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/HCEHYO4UVU3KWAJVTI7PCELBPQ","json":"https://pith.science/pith/HCEHYO4UVU3KWAJVTI7PCELBPQ.json","graph_json":"https://pith.science/api/pith-number/HCEHYO4UVU3KWAJVTI7PCELBPQ/graph.json","events_json":"https://pith.science/api/pith-number/HCEHYO4UVU3KWAJVTI7PCELBPQ/events.json","paper":"https://pith.science/paper/HCEHYO4U"},"agent_actions":{"view_html":"https://pith.science/pith/HCEHYO4UVU3KWAJVTI7PCELBPQ","download_json":"https://pith.science/pith/HCEHYO4UVU3KWAJVTI7PCELBPQ.json","view_paper":"https://pith.science/paper/HCEHYO4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0080&json=true","fetch_graph":"https://pith.science/api/pith-number/HCEHYO4UVU3KWAJVTI7PCELBPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HCEHYO4UVU3KWAJVTI7PCELBPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCEHYO4UVU3KWAJVTI7PCELBPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCEHYO4UVU3KWAJVTI7PCELBPQ/action/storage_attestation","attest_author":"https://pith.science/pith/HCEHYO4UVU3KWAJVTI7PCELBPQ/action/author_attestation","sign_citation":"https://pith.science/pith/HCEHYO4UVU3KWAJVTI7PCELBPQ/action/citation_signature","submit_replication":"https://pith.science/pith/HCEHYO4UVU3KWAJVTI7PCELBPQ/action/replication_record"}},"created_at":"2026-05-18T04:00:28.468660+00:00","updated_at":"2026-05-18T04:00:28.468660+00:00"}