{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:47ELP6FAZ4FD24HF4J66OP53XI","short_pith_number":"pith:47ELP6FA","schema_version":"1.0","canonical_sha256":"e7c8b7f8a0cf0a3d70e5e27de73fbbba1a8dd4ecff328d5c74da871085ecfe23","source":{"kind":"arxiv","id":"1501.04402","version":1},"attestation_state":"computed","paper":{"title":"Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hirotaka Ono, Tadashi Wadayama, Taizuke Izumi","submitted_at":"2015-01-19T06:22:09Z","abstract_excerpt":"A code design problem for memory devises with restricted state transitions is formulated as a combinatorial optimization problem that is called a subgraph domatic partition (subDP) problem. If any neighbor set of a given state transition graph contains all the colors, then the coloring is said to be valid. The goal of a subDP problem is to find a valid coloring with the largest number of colors for a subgraph of a given directed graph. The number of colors in an optimal valid coloring gives the writing capacity of a given state transition graph. The subDP problems are computationally hard; it "},"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":"1501.04402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-19T06:22:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"20e4c07d5d891e6a16e7dd3ee99afaf9268a7d19e0ef7419b2f02666d50705fb","abstract_canon_sha256":"53a20dcfd4c73d4bbab67ed3e7f67b5e1e238cfaf4a2f5a56aeb916f060a8ce2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:09.105983Z","signature_b64":"e8/DjFt2hotncH4ZGPLIFQW3XlmNg2+CiJVycR/sr776sRt1loaVt/73Q9sXnHIbE7UzKS8QpuINyybgpc9WBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7c8b7f8a0cf0a3d70e5e27de73fbbba1a8dd4ecff328d5c74da871085ecfe23","last_reissued_at":"2026-05-18T02:29:09.105416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:09.105416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hirotaka Ono, Tadashi Wadayama, Taizuke Izumi","submitted_at":"2015-01-19T06:22:09Z","abstract_excerpt":"A code design problem for memory devises with restricted state transitions is formulated as a combinatorial optimization problem that is called a subgraph domatic partition (subDP) problem. If any neighbor set of a given state transition graph contains all the colors, then the coloring is said to be valid. The goal of a subDP problem is to find a valid coloring with the largest number of colors for a subgraph of a given directed graph. The number of colors in an optimal valid coloring gives the writing capacity of a given state transition graph. The subDP problems are computationally hard; it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04402","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":"1501.04402","created_at":"2026-05-18T02:29:09.105494+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04402v1","created_at":"2026-05-18T02:29:09.105494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04402","created_at":"2026-05-18T02:29:09.105494+00:00"},{"alias_kind":"pith_short_12","alias_value":"47ELP6FAZ4FD","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"47ELP6FAZ4FD24HF","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"47ELP6FA","created_at":"2026-05-18T12:29:05.191682+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/47ELP6FAZ4FD24HF4J66OP53XI","json":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI.json","graph_json":"https://pith.science/api/pith-number/47ELP6FAZ4FD24HF4J66OP53XI/graph.json","events_json":"https://pith.science/api/pith-number/47ELP6FAZ4FD24HF4J66OP53XI/events.json","paper":"https://pith.science/paper/47ELP6FA"},"agent_actions":{"view_html":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI","download_json":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI.json","view_paper":"https://pith.science/paper/47ELP6FA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04402&json=true","fetch_graph":"https://pith.science/api/pith-number/47ELP6FAZ4FD24HF4J66OP53XI/graph.json","fetch_events":"https://pith.science/api/pith-number/47ELP6FAZ4FD24HF4J66OP53XI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI/action/storage_attestation","attest_author":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI/action/author_attestation","sign_citation":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI/action/citation_signature","submit_replication":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI/action/replication_record"}},"created_at":"2026-05-18T02:29:09.105494+00:00","updated_at":"2026-05-18T02:29:09.105494+00:00"}