{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BOHHVPDYUOYVRAVG44VFGFFALR","short_pith_number":"pith:BOHHVPDY","schema_version":"1.0","canonical_sha256":"0b8e7abc78a3b15882a6e72a5314a05c7b893c9180a8f94c43dcdc909b12e060","source":{"kind":"arxiv","id":"1404.6620","version":2},"attestation_state":"computed","paper":{"title":"Fulcrum Network Codes: A Code for Fluid Allocation of Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Chres W. S{\\o}rensen, Daniel E. Lucani, Diego Ruano, Frank H. P. Fitzek, Janus Heide, Morten V. Pedersen, Olav Geil","submitted_at":"2014-04-26T07:31:52Z","abstract_excerpt":"This paper proposes Fulcrum network codes, a network coding framework that achieves three seemingly conflicting objectives: (i) to reduce the coding coefficient overhead to almost n bits per packet in a generation of n packets; (ii) to operate the network using only GF(2) operations at intermediate nodes if necessary, dramatically reducing complexity in the network; (iii) to deliver an end-to-end performance that is close to that of a high-field network coding system for high-end receivers while simultaneously catering to low-end receivers that decode in GF(2). As a consequence of (ii) and (ii"},"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":"1404.6620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-26T07:31:52Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"ea05d78c4604b55d5441f1b6ca33ad0637f37ebd82802691aecf208ccb1a25e4","abstract_canon_sha256":"a1ef6c02ec00f1d6f3df829214822f075784a850dd406198f23bfab80174e645"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:39.791350Z","signature_b64":"P69JiZ981QWdTp1I6w45BxVsJnyYcRYvWqR3LiYi7Wkz5/woj6dihNobQ+kM1luJ6HHBr2tXd1KBujMnUsDSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b8e7abc78a3b15882a6e72a5314a05c7b893c9180a8f94c43dcdc909b12e060","last_reissued_at":"2026-05-18T01:26:39.790701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:39.790701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fulcrum Network Codes: A Code for Fluid Allocation of Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Chres W. S{\\o}rensen, Daniel E. Lucani, Diego Ruano, Frank H. P. Fitzek, Janus Heide, Morten V. Pedersen, Olav Geil","submitted_at":"2014-04-26T07:31:52Z","abstract_excerpt":"This paper proposes Fulcrum network codes, a network coding framework that achieves three seemingly conflicting objectives: (i) to reduce the coding coefficient overhead to almost n bits per packet in a generation of n packets; (ii) to operate the network using only GF(2) operations at intermediate nodes if necessary, dramatically reducing complexity in the network; (iii) to deliver an end-to-end performance that is close to that of a high-field network coding system for high-end receivers while simultaneously catering to low-end receivers that decode in GF(2). As a consequence of (ii) and (ii"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6620","kind":"arxiv","version":2},"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":"1404.6620","created_at":"2026-05-18T01:26:39.790802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6620v2","created_at":"2026-05-18T01:26:39.790802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6620","created_at":"2026-05-18T01:26:39.790802+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOHHVPDYUOYV","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOHHVPDYUOYVRAVG","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOHHVPDY","created_at":"2026-05-18T12:28:22.404517+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/BOHHVPDYUOYVRAVG44VFGFFALR","json":"https://pith.science/pith/BOHHVPDYUOYVRAVG44VFGFFALR.json","graph_json":"https://pith.science/api/pith-number/BOHHVPDYUOYVRAVG44VFGFFALR/graph.json","events_json":"https://pith.science/api/pith-number/BOHHVPDYUOYVRAVG44VFGFFALR/events.json","paper":"https://pith.science/paper/BOHHVPDY"},"agent_actions":{"view_html":"https://pith.science/pith/BOHHVPDYUOYVRAVG44VFGFFALR","download_json":"https://pith.science/pith/BOHHVPDYUOYVRAVG44VFGFFALR.json","view_paper":"https://pith.science/paper/BOHHVPDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6620&json=true","fetch_graph":"https://pith.science/api/pith-number/BOHHVPDYUOYVRAVG44VFGFFALR/graph.json","fetch_events":"https://pith.science/api/pith-number/BOHHVPDYUOYVRAVG44VFGFFALR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOHHVPDYUOYVRAVG44VFGFFALR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOHHVPDYUOYVRAVG44VFGFFALR/action/storage_attestation","attest_author":"https://pith.science/pith/BOHHVPDYUOYVRAVG44VFGFFALR/action/author_attestation","sign_citation":"https://pith.science/pith/BOHHVPDYUOYVRAVG44VFGFFALR/action/citation_signature","submit_replication":"https://pith.science/pith/BOHHVPDYUOYVRAVG44VFGFFALR/action/replication_record"}},"created_at":"2026-05-18T01:26:39.790802+00:00","updated_at":"2026-05-18T01:26:39.790802+00:00"}