{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UD3EUI33N5LXANXPBW6NEA46H4","short_pith_number":"pith:UD3EUI33","schema_version":"1.0","canonical_sha256":"a0f64a237b6f577036ef0dbcd2039e3f1f8b7094bf694d70191a48b294ed3bee","source":{"kind":"arxiv","id":"1904.09438","version":1},"attestation_state":"computed","paper":{"title":"Decomposing a Graph into Unigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Jun Kawahara, Shin-ichi Minato, Takashi Horiyama, Yu Nakahata","submitted_at":"2019-04-20T12:05:49Z","abstract_excerpt":"Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these subclasses are well studied in the literature. Nevertheless, there are few results on superclasses of unigraphs. In this paper, we introduce two types of generalizations of unigraphs: $k$-unigraphs and $k$-strong unigraphs. We say that a graph $G$ is a $k$-unigraph if $G$ can be partitioned into $k$ unigraphs. $G$ is a $k$-strong unigraph if not only each su"},"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":"1904.09438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-20T12:05:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b311daaac6a10c4b280863d9027d3fb708a99a9e3f9e025aa8a1389297b3455d","abstract_canon_sha256":"08939fdd41e4b35758ee42c281a4c6eb2b46bd34d4919d044649e2d691b3fe04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:04.187551Z","signature_b64":"Rt3vPSVx9ryiQMJD52HIosTl0N3C3Kr1wpwbi7RZYyKTB2Ae9KthBy+lUb5vjiCahOkhENwTjZyd5Su2vwyLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0f64a237b6f577036ef0dbcd2039e3f1f8b7094bf694d70191a48b294ed3bee","last_reissued_at":"2026-05-17T23:48:04.187149Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:04.187149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing a Graph into Unigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Jun Kawahara, Shin-ichi Minato, Takashi Horiyama, Yu Nakahata","submitted_at":"2019-04-20T12:05:49Z","abstract_excerpt":"Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these subclasses are well studied in the literature. Nevertheless, there are few results on superclasses of unigraphs. In this paper, we introduce two types of generalizations of unigraphs: $k$-unigraphs and $k$-strong unigraphs. We say that a graph $G$ is a $k$-unigraph if $G$ can be partitioned into $k$ unigraphs. $G$ is a $k$-strong unigraph if not only each su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09438","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":"1904.09438","created_at":"2026-05-17T23:48:04.187207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09438v1","created_at":"2026-05-17T23:48:04.187207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09438","created_at":"2026-05-17T23:48:04.187207+00:00"},{"alias_kind":"pith_short_12","alias_value":"UD3EUI33N5LX","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UD3EUI33N5LXANXP","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UD3EUI33","created_at":"2026-05-18T12:33:30.264802+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/UD3EUI33N5LXANXPBW6NEA46H4","json":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4.json","graph_json":"https://pith.science/api/pith-number/UD3EUI33N5LXANXPBW6NEA46H4/graph.json","events_json":"https://pith.science/api/pith-number/UD3EUI33N5LXANXPBW6NEA46H4/events.json","paper":"https://pith.science/paper/UD3EUI33"},"agent_actions":{"view_html":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4","download_json":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4.json","view_paper":"https://pith.science/paper/UD3EUI33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09438&json=true","fetch_graph":"https://pith.science/api/pith-number/UD3EUI33N5LXANXPBW6NEA46H4/graph.json","fetch_events":"https://pith.science/api/pith-number/UD3EUI33N5LXANXPBW6NEA46H4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4/action/storage_attestation","attest_author":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4/action/author_attestation","sign_citation":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4/action/citation_signature","submit_replication":"https://pith.science/pith/UD3EUI33N5LXANXPBW6NEA46H4/action/replication_record"}},"created_at":"2026-05-17T23:48:04.187207+00:00","updated_at":"2026-05-17T23:48:04.187207+00:00"}