{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DFGGFU7F2X4PIBS7SY6CJALMG4","short_pith_number":"pith:DFGGFU7F","schema_version":"1.0","canonical_sha256":"194c62d3e5d5f8f4065f963c24816c372abdec697733de03fc6dacf7ffee3bc5","source":{"kind":"arxiv","id":"1110.3855","version":1},"attestation_state":"computed","paper":{"title":"An Upper Bound on Broadcast Subspace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"Thomas Honold, Yimin Pang","submitted_at":"2011-10-18T00:22:06Z","abstract_excerpt":"Linear operator broadcast channel (LOBC) models the scenario of multi-rate packet broadcasting over a network, when random network coding is applied. This paper presents the framework of algebraic coding for LOBCs and provides a Hamming-like upper bound on (multishot) subspace codes for LOBCs."},"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":"1110.3855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T00:22:06Z","cross_cats_sorted":["math.AG","math.IT"],"title_canon_sha256":"b46e9974652601a5706aa02051c72e80580fb4ddd470f3b73cb77f691a120cf5","abstract_canon_sha256":"506667fcc69e89434443021e8f58efa58b1ea6945d42c148965ce431fe8f7d57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:47.796145Z","signature_b64":"zwIZSTGXTRKtXcT6oz3upCgYEwmIw0WVmfGPz+ev5n4s9AzuBMKPIxGc3XY/HT12CAJPJJMTbeLdpBiYE/TcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"194c62d3e5d5f8f4065f963c24816c372abdec697733de03fc6dacf7ffee3bc5","last_reissued_at":"2026-05-18T04:10:47.795768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:47.795768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Upper Bound on Broadcast Subspace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"Thomas Honold, Yimin Pang","submitted_at":"2011-10-18T00:22:06Z","abstract_excerpt":"Linear operator broadcast channel (LOBC) models the scenario of multi-rate packet broadcasting over a network, when random network coding is applied. This paper presents the framework of algebraic coding for LOBCs and provides a Hamming-like upper bound on (multishot) subspace codes for LOBCs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3855","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":"1110.3855","created_at":"2026-05-18T04:10:47.795825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3855v1","created_at":"2026-05-18T04:10:47.795825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3855","created_at":"2026-05-18T04:10:47.795825+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFGGFU7F2X4P","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFGGFU7F2X4PIBS7","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFGGFU7F","created_at":"2026-05-18T12:26:26.731475+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/DFGGFU7F2X4PIBS7SY6CJALMG4","json":"https://pith.science/pith/DFGGFU7F2X4PIBS7SY6CJALMG4.json","graph_json":"https://pith.science/api/pith-number/DFGGFU7F2X4PIBS7SY6CJALMG4/graph.json","events_json":"https://pith.science/api/pith-number/DFGGFU7F2X4PIBS7SY6CJALMG4/events.json","paper":"https://pith.science/paper/DFGGFU7F"},"agent_actions":{"view_html":"https://pith.science/pith/DFGGFU7F2X4PIBS7SY6CJALMG4","download_json":"https://pith.science/pith/DFGGFU7F2X4PIBS7SY6CJALMG4.json","view_paper":"https://pith.science/paper/DFGGFU7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3855&json=true","fetch_graph":"https://pith.science/api/pith-number/DFGGFU7F2X4PIBS7SY6CJALMG4/graph.json","fetch_events":"https://pith.science/api/pith-number/DFGGFU7F2X4PIBS7SY6CJALMG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFGGFU7F2X4PIBS7SY6CJALMG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFGGFU7F2X4PIBS7SY6CJALMG4/action/storage_attestation","attest_author":"https://pith.science/pith/DFGGFU7F2X4PIBS7SY6CJALMG4/action/author_attestation","sign_citation":"https://pith.science/pith/DFGGFU7F2X4PIBS7SY6CJALMG4/action/citation_signature","submit_replication":"https://pith.science/pith/DFGGFU7F2X4PIBS7SY6CJALMG4/action/replication_record"}},"created_at":"2026-05-18T04:10:47.795825+00:00","updated_at":"2026-05-18T04:10:47.795825+00:00"}