{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2YUVIEHHVX5KE6TJUYPUK563H4","short_pith_number":"pith:2YUVIEHH","schema_version":"1.0","canonical_sha256":"d6295410e7adfaa27a69a61f4577db3f2c3d88d4f13ed8731394949d4afa3773","source":{"kind":"arxiv","id":"1801.04472","version":1},"attestation_state":"computed","paper":{"title":"Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ali Dehghan, Arash Ahadi, Mohammad-Reza Sadeghi","submitted_at":"2018-01-13T18:12:57Z","abstract_excerpt":"A Not-All-Equal (NAE) decomposition of a graph $G$ is a decomposition of the vertices of $G$ into two parts such that each vertex in $G$ has at least one neighbor in each part. Also, a 1-in-Degree decomposition of a graph $G$ is a decomposition of the vertices of $G$ into two parts $A$ and $B$ such that each vertex in the graph $G$ has exactly one neighbor in part $A$. Among our results, we show that for a given graph $G$, if $G$ does not have any cycle of length congruent to 2 mod 4, then there is a polynomial time algorithm to decide whether $G$ has a 1-in-Degree decomposition. In sharp cont"},"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":"1801.04472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-13T18:12:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0a47a8d92244e4366a354e117b5e85d9f3345ec3d44f3435a75dc90fa3e3bc8e","abstract_canon_sha256":"0b2da088f34f28201ec289a2c3cd8b44ec2c73c5618c0fe3660cb1d1149a7ce5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:06.386623Z","signature_b64":"zkJomnxTfDWafeIvSebebevEMIZnYAZ2c3Bsxm7TIiAmgf4Oas5u3R2yeJ8yMHLYpx75uSY4O1zQyqhTg0sdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6295410e7adfaa27a69a61f4577db3f2c3d88d4f13ed8731394949d4afa3773","last_reissued_at":"2026-05-18T00:26:06.385937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:06.385937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ali Dehghan, Arash Ahadi, Mohammad-Reza Sadeghi","submitted_at":"2018-01-13T18:12:57Z","abstract_excerpt":"A Not-All-Equal (NAE) decomposition of a graph $G$ is a decomposition of the vertices of $G$ into two parts such that each vertex in $G$ has at least one neighbor in each part. Also, a 1-in-Degree decomposition of a graph $G$ is a decomposition of the vertices of $G$ into two parts $A$ and $B$ such that each vertex in the graph $G$ has exactly one neighbor in part $A$. Among our results, we show that for a given graph $G$, if $G$ does not have any cycle of length congruent to 2 mod 4, then there is a polynomial time algorithm to decide whether $G$ has a 1-in-Degree decomposition. In sharp cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04472","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":"1801.04472","created_at":"2026-05-18T00:26:06.386034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04472v1","created_at":"2026-05-18T00:26:06.386034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04472","created_at":"2026-05-18T00:26:06.386034+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YUVIEHHVX5K","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YUVIEHHVX5KE6TJ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YUVIEHH","created_at":"2026-05-18T12:32:02.567920+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/2YUVIEHHVX5KE6TJUYPUK563H4","json":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4.json","graph_json":"https://pith.science/api/pith-number/2YUVIEHHVX5KE6TJUYPUK563H4/graph.json","events_json":"https://pith.science/api/pith-number/2YUVIEHHVX5KE6TJUYPUK563H4/events.json","paper":"https://pith.science/paper/2YUVIEHH"},"agent_actions":{"view_html":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4","download_json":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4.json","view_paper":"https://pith.science/paper/2YUVIEHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04472&json=true","fetch_graph":"https://pith.science/api/pith-number/2YUVIEHHVX5KE6TJUYPUK563H4/graph.json","fetch_events":"https://pith.science/api/pith-number/2YUVIEHHVX5KE6TJUYPUK563H4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4/action/storage_attestation","attest_author":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4/action/author_attestation","sign_citation":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4/action/citation_signature","submit_replication":"https://pith.science/pith/2YUVIEHHVX5KE6TJUYPUK563H4/action/replication_record"}},"created_at":"2026-05-18T00:26:06.386034+00:00","updated_at":"2026-05-18T00:26:06.386034+00:00"}