{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LXLLLULR6TPWHCX4MQW3XDX6IH","short_pith_number":"pith:LXLLLULR","schema_version":"1.0","canonical_sha256":"5dd6b5d171f4df638afc642dbb8efe41ed3ef1d56ac6fcfac0498ded0c843718","source":{"kind":"arxiv","id":"1603.01468","version":1},"attestation_state":"computed","paper":{"title":"Edge Coloring and Stopping Sets Analysis in Product Codes with MDS components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fanny Jardel, Joseph J. Boutros","submitted_at":"2016-03-04T13:54:06Z","abstract_excerpt":"We consider non-binary product codes with MDS components and their iterative row-column algebraic decoding on the erasure channel. Both independent and block erasures are considered in this paper. A compact graph representation is introduced on which we define double-diversity edge colorings via the rootcheck concept. An upper bound of the number of decoding iterations is given as a function of the graph size and the color palette size $M$. Stopping sets are defined in the context of MDS components and a relationship is established with the graph representation. A full characterization of thes"},"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":"1603.01468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T13:54:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5094a7f5ba8304ec990eb656297038f2be7f886c05dd4a174f3f398be82363c9","abstract_canon_sha256":"0f4533d15080a148a8587045cb14b33c99d9bbf3765afd0d6c9589cf677e3f24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:35.960926Z","signature_b64":"NgKNa18lYXeUG0ZrBaKuo/PrnRLTydRVrrhVdZMsIQMMRJi4SfS7dalGRtd9UrYFTMUW6iuVXRS+FeG7CYR3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dd6b5d171f4df638afc642dbb8efe41ed3ef1d56ac6fcfac0498ded0c843718","last_reissued_at":"2026-05-18T01:19:35.960432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:35.960432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge Coloring and Stopping Sets Analysis in Product Codes with MDS components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fanny Jardel, Joseph J. Boutros","submitted_at":"2016-03-04T13:54:06Z","abstract_excerpt":"We consider non-binary product codes with MDS components and their iterative row-column algebraic decoding on the erasure channel. Both independent and block erasures are considered in this paper. A compact graph representation is introduced on which we define double-diversity edge colorings via the rootcheck concept. An upper bound of the number of decoding iterations is given as a function of the graph size and the color palette size $M$. Stopping sets are defined in the context of MDS components and a relationship is established with the graph representation. A full characterization of thes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01468","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":"1603.01468","created_at":"2026-05-18T01:19:35.960501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01468v1","created_at":"2026-05-18T01:19:35.960501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01468","created_at":"2026-05-18T01:19:35.960501+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXLLLULR6TPW","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXLLLULR6TPWHCX4","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXLLLULR","created_at":"2026-05-18T12:30:29.479603+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/LXLLLULR6TPWHCX4MQW3XDX6IH","json":"https://pith.science/pith/LXLLLULR6TPWHCX4MQW3XDX6IH.json","graph_json":"https://pith.science/api/pith-number/LXLLLULR6TPWHCX4MQW3XDX6IH/graph.json","events_json":"https://pith.science/api/pith-number/LXLLLULR6TPWHCX4MQW3XDX6IH/events.json","paper":"https://pith.science/paper/LXLLLULR"},"agent_actions":{"view_html":"https://pith.science/pith/LXLLLULR6TPWHCX4MQW3XDX6IH","download_json":"https://pith.science/pith/LXLLLULR6TPWHCX4MQW3XDX6IH.json","view_paper":"https://pith.science/paper/LXLLLULR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01468&json=true","fetch_graph":"https://pith.science/api/pith-number/LXLLLULR6TPWHCX4MQW3XDX6IH/graph.json","fetch_events":"https://pith.science/api/pith-number/LXLLLULR6TPWHCX4MQW3XDX6IH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXLLLULR6TPWHCX4MQW3XDX6IH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXLLLULR6TPWHCX4MQW3XDX6IH/action/storage_attestation","attest_author":"https://pith.science/pith/LXLLLULR6TPWHCX4MQW3XDX6IH/action/author_attestation","sign_citation":"https://pith.science/pith/LXLLLULR6TPWHCX4MQW3XDX6IH/action/citation_signature","submit_replication":"https://pith.science/pith/LXLLLULR6TPWHCX4MQW3XDX6IH/action/replication_record"}},"created_at":"2026-05-18T01:19:35.960501+00:00","updated_at":"2026-05-18T01:19:35.960501+00:00"}