{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XKMEE3TIJ2IBYQNXMCY6GZMZYQ","short_pith_number":"pith:XKMEE3TI","canonical_record":{"source":{"id":"1606.00974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-03T06:05:44Z","cross_cats_sorted":[],"title_canon_sha256":"dcbf0e30a66dabbda1368bf69ade5d876e231f86a4f33ef7741ec6bd04b519c3","abstract_canon_sha256":"9c5245247490b2366bb9e1f9cab0c6b96d800aff8b4dd79fc900328a930aa825"},"schema_version":"1.0"},"canonical_sha256":"ba98426e684e901c41b760b1e36599c405544d78885c372035b23d9932823ede","source":{"kind":"arxiv","id":"1606.00974","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00974","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00974v1","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00974","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"XKMEE3TIJ2IB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XKMEE3TIJ2IBYQNX","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XKMEE3TI","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XKMEE3TIJ2IBYQNXMCY6GZMZYQ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-03T06:05:44Z","cross_cats_sorted":[],"title_canon_sha256":"dcbf0e30a66dabbda1368bf69ade5d876e231f86a4f33ef7741ec6bd04b519c3","abstract_canon_sha256":"9c5245247490b2366bb9e1f9cab0c6b96d800aff8b4dd79fc900328a930aa825"},"schema_version":"1.0"},"canonical_sha256":"ba98426e684e901c41b760b1e36599c405544d78885c372035b23d9932823ede","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:59.981816Z","signature_b64":"VtlE+cF1y0v1aLHKT9eDFHNDRGATth2Ea4Tylg3BHuG68LUVo15rNYYwuTR7lEskVLrAeXTU0EQ2CgT2oSNuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba98426e684e901c41b760b1e36599c405544d78885c372035b23d9932823ede","last_reissued_at":"2026-05-18T01:12:59.981448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:59.981448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00974","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-18T01:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qe1rlV3jUx5Uw6OJJhA6Go+M7Z9SrngIyKcwEZ95MzHthS4P7DCrFdBpy2oCZYABRtYB05bkRZq2G2fCr+q/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:23:33.646884Z"},"content_sha256":"c83ddd30b2ea3ff3eda8787923424ae4dc845026cf5f52af8af161d65c0d2e15","schema_version":"1.0","event_id":"sha256:c83ddd30b2ea3ff3eda8787923424ae4dc845026cf5f52af8af161d65c0d2e15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XKMEE3TIJ2IBYQNXMCY6GZMZYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Graph Theoretical Analysis of Low-Power Coding Schemes for One-Hop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Akiko Manada, Eimear Byrne","submitted_at":"2016-06-03T06:05:44Z","abstract_excerpt":"Coding schemes with extremely low computational complexity are required for particular applications, such as wireless body area networks, in which case both very high data accuracy and very low power-consumption are required features. In this paper, coding schemes arising from incidence matrices of graphs are proposed. An analysis of the resilience of such codes to erasures is given using graph theoretical arguments; decodability of a graph is characterized in terms of the rank of its incidence matrix. Bounds are given on the number of decodable subgraphs of a graph and the number of edges tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00974","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-18T01:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iy/7gcQEPN5Fzk2IFi16O0dHF6/IjfVoXf44e2Iy2OFavcdPBl8FL+8YgSRRuiSm8gVCekwbuHeokmE4RA5aDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:23:33.647234Z"},"content_sha256":"bc691e1c70aa6b615e3f71dee68db5b99dac093856ae6fe5906450b5fe652699","schema_version":"1.0","event_id":"sha256:bc691e1c70aa6b615e3f71dee68db5b99dac093856ae6fe5906450b5fe652699"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XKMEE3TIJ2IBYQNXMCY6GZMZYQ/bundle.json","state_url":"https://pith.science/pith/XKMEE3TIJ2IBYQNXMCY6GZMZYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XKMEE3TIJ2IBYQNXMCY6GZMZYQ/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-06-03T05:23:33Z","links":{"resolver":"https://pith.science/pith/XKMEE3TIJ2IBYQNXMCY6GZMZYQ","bundle":"https://pith.science/pith/XKMEE3TIJ2IBYQNXMCY6GZMZYQ/bundle.json","state":"https://pith.science/pith/XKMEE3TIJ2IBYQNXMCY6GZMZYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XKMEE3TIJ2IBYQNXMCY6GZMZYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XKMEE3TIJ2IBYQNXMCY6GZMZYQ","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":"9c5245247490b2366bb9e1f9cab0c6b96d800aff8b4dd79fc900328a930aa825","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-03T06:05:44Z","title_canon_sha256":"dcbf0e30a66dabbda1368bf69ade5d876e231f86a4f33ef7741ec6bd04b519c3"},"schema_version":"1.0","source":{"id":"1606.00974","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00974","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00974v1","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00974","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"XKMEE3TIJ2IB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XKMEE3TIJ2IBYQNX","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XKMEE3TI","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:bc691e1c70aa6b615e3f71dee68db5b99dac093856ae6fe5906450b5fe652699","target":"graph","created_at":"2026-05-18T01:12:59Z","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":"Coding schemes with extremely low computational complexity are required for particular applications, such as wireless body area networks, in which case both very high data accuracy and very low power-consumption are required features. In this paper, coding schemes arising from incidence matrices of graphs are proposed. An analysis of the resilience of such codes to erasures is given using graph theoretical arguments; decodability of a graph is characterized in terms of the rank of its incidence matrix. Bounds are given on the number of decodable subgraphs of a graph and the number of edges tha","authors_text":"Akiko Manada, Eimear Byrne","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-03T06:05:44Z","title":"A Graph Theoretical Analysis of Low-Power Coding Schemes for One-Hop Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00974","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:c83ddd30b2ea3ff3eda8787923424ae4dc845026cf5f52af8af161d65c0d2e15","target":"record","created_at":"2026-05-18T01:12:59Z","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":"9c5245247490b2366bb9e1f9cab0c6b96d800aff8b4dd79fc900328a930aa825","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-03T06:05:44Z","title_canon_sha256":"dcbf0e30a66dabbda1368bf69ade5d876e231f86a4f33ef7741ec6bd04b519c3"},"schema_version":"1.0","source":{"id":"1606.00974","kind":"arxiv","version":1}},"canonical_sha256":"ba98426e684e901c41b760b1e36599c405544d78885c372035b23d9932823ede","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba98426e684e901c41b760b1e36599c405544d78885c372035b23d9932823ede","first_computed_at":"2026-05-18T01:12:59.981448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:59.981448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VtlE+cF1y0v1aLHKT9eDFHNDRGATth2Ea4Tylg3BHuG68LUVo15rNYYwuTR7lEskVLrAeXTU0EQ2CgT2oSNuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:59.981816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00974","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c83ddd30b2ea3ff3eda8787923424ae4dc845026cf5f52af8af161d65c0d2e15","sha256:bc691e1c70aa6b615e3f71dee68db5b99dac093856ae6fe5906450b5fe652699"],"state_sha256":"715e8d0c474f0bbf90df3fc2d754dbe13892b273e4cc6e9fd824e7d0fc44f518"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BiI+n55T1fJFFOlATNztC0fTeXKHKMisdpqxxRZtZMb1r5LHtyAhUqctixnDW/TSYWpPxytLxmHVal2h4WrMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:23:33.649153Z","bundle_sha256":"0e8f8727cf3a3074e6decccc85d4d89e4a144ca6d99b4e82aa5312e75b3eab03"}}