{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:47ELP6FAZ4FD24HF4J66OP53XI","short_pith_number":"pith:47ELP6FA","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"},"canonical_sha256":"e7c8b7f8a0cf0a3d70e5e27de73fbbba1a8dd4ecff328d5c74da871085ecfe23","source":{"kind":"arxiv","id":"1501.04402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04402","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04402v1","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04402","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"pith_short_12","alias_value":"47ELP6FAZ4FD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"47ELP6FAZ4FD24HF","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"47ELP6FA","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:47ELP6FAZ4FD24HF4J66OP53XI","target":"record","payload":{"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"},"canonical_sha256":"e7c8b7f8a0cf0a3d70e5e27de73fbbba1a8dd4ecff328d5c74da871085ecfe23","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"},"source_kind":"arxiv","source_id":"1501.04402","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:29:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M38BEazhT5uDpl2YQ9MjIQb6NPKy/bUFolZJ41sJ0GS9FojKh51AagnmhDq+1+5c7GoFjGHM26XK5gAwhz2FAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:42:54.570924Z"},"content_sha256":"91c6b0abd0843514d71fb6723215b93082ba877eb08e07790ab981dab555e63a","schema_version":"1.0","event_id":"sha256:91c6b0abd0843514d71fb6723215b93082ba877eb08e07790ab981dab555e63a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:47ELP6FAZ4FD24HF4J66OP53XI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:29:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/St5jaADvJ0ZZia6BU1nFEd3Tz/tNS8bn+eK8Q3ouUQP/xao5a5n1g89TRCpxEQMM1KgYB1f5T7eRHKlX0KxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T21:42:54.571597Z"},"content_sha256":"717180d5716044d1c89b421b687d6d1d45caeac6cd2ee065f2f5f12492448824","schema_version":"1.0","event_id":"sha256:717180d5716044d1c89b421b687d6d1d45caeac6cd2ee065f2f5f12492448824"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI/bundle.json","state_url":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47ELP6FAZ4FD24HF4J66OP53XI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T21:42:54Z","links":{"resolver":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI","bundle":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI/bundle.json","state":"https://pith.science/pith/47ELP6FAZ4FD24HF4J66OP53XI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47ELP6FAZ4FD24HF4J66OP53XI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:47ELP6FAZ4FD24HF4J66OP53XI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"53a20dcfd4c73d4bbab67ed3e7f67b5e1e238cfaf4a2f5a56aeb916f060a8ce2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-19T06:22:09Z","title_canon_sha256":"20e4c07d5d891e6a16e7dd3ee99afaf9268a7d19e0ef7419b2f02666d50705fb"},"schema_version":"1.0","source":{"id":"1501.04402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04402","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04402v1","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04402","created_at":"2026-05-18T02:29:09Z"},{"alias_kind":"pith_short_12","alias_value":"47ELP6FAZ4FD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"47ELP6FAZ4FD24HF","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"47ELP6FA","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:717180d5716044d1c89b421b687d6d1d45caeac6cd2ee065f2f5f12492448824","target":"graph","created_at":"2026-05-18T02:29:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Hirotaka Ono, Tadashi Wadayama, Taizuke Izumi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-19T06:22:09Z","title":"Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04402","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:91c6b0abd0843514d71fb6723215b93082ba877eb08e07790ab981dab555e63a","target":"record","created_at":"2026-05-18T02:29:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"53a20dcfd4c73d4bbab67ed3e7f67b5e1e238cfaf4a2f5a56aeb916f060a8ce2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-19T06:22:09Z","title_canon_sha256":"20e4c07d5d891e6a16e7dd3ee99afaf9268a7d19e0ef7419b2f02666d50705fb"},"schema_version":"1.0","source":{"id":"1501.04402","kind":"arxiv","version":1}},"canonical_sha256":"e7c8b7f8a0cf0a3d70e5e27de73fbbba1a8dd4ecff328d5c74da871085ecfe23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7c8b7f8a0cf0a3d70e5e27de73fbbba1a8dd4ecff328d5c74da871085ecfe23","first_computed_at":"2026-05-18T02:29:09.105416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:09.105416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e8/DjFt2hotncH4ZGPLIFQW3XlmNg2+CiJVycR/sr776sRt1loaVt/73Q9sXnHIbE7UzKS8QpuINyybgpc9WBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:09.105983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91c6b0abd0843514d71fb6723215b93082ba877eb08e07790ab981dab555e63a","sha256:717180d5716044d1c89b421b687d6d1d45caeac6cd2ee065f2f5f12492448824"],"state_sha256":"39cfb54357ed3502df850e9a25efad58dfef548c3ea88ceb2b1d2a73c5c0d132"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7IuMPwIMNsXGPRCOjh0FjvI/drIhQyLBZ42oCAUTHD6hbR8CGxshUOoyBD8ewEtUkJ6U90SxdBgM9Li+eQBUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T21:42:54.574818Z","bundle_sha256":"73425ee50335565921ed3038d5ea4ca1f4aad2ff05fea5c6aa1669c4946eaf72"}}