{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:SUMX65RGS52A73VLIWYBCW3RSS","short_pith_number":"pith:SUMX65RG","schema_version":"1.0","canonical_sha256":"95197f762697740feeab45b0115b7194846db695701e937dd5e4b2ddb49594a9","source":{"kind":"arxiv","id":"0807.1158","version":2},"attestation_state":"computed","paper":{"title":"Path Gain Algebraic Formulation for the Scalar Linear Network Coding Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhay T. Subramanian, Andrew Thangaraj","submitted_at":"2008-07-08T02:51:49Z","abstract_excerpt":"In the algebraic view, the solution to a network coding problem is seen as a variety specified by a system of polynomial equations typically derived by using edge-to-edge gains as variables. The output from each sink is equated to its demand to obtain polynomial equations. In this work, we propose a method to derive the polynomial equations using source-to-sink path gains as the variables. In the path gain formulation, we show that linear and quadratic equations suffice; therefore, network coding becomes equivalent to a system of polynomial equations of maximum degree 2. We present algorithms "},"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":"0807.1158","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-07-08T02:51:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"acab5da6a142d5f45b2a2468e8ebd3a4cc1589c872514f1961b0114bc98ba2de","abstract_canon_sha256":"47b086ab7811490a7e9c5900a01bad5a92831c01d660d11b576a41df4ced0522"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.515239Z","signature_b64":"QW3KuKykJFurRevabjz97o1P1/3wWXs+z0QzqqVrARVfOPR6ler2It/avEKJoDMfqs/c5TsV4KxxplpmdhsYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95197f762697740feeab45b0115b7194846db695701e937dd5e4b2ddb49594a9","last_reissued_at":"2026-05-18T00:58:25.514557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.514557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path Gain Algebraic Formulation for the Scalar Linear Network Coding Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhay T. Subramanian, Andrew Thangaraj","submitted_at":"2008-07-08T02:51:49Z","abstract_excerpt":"In the algebraic view, the solution to a network coding problem is seen as a variety specified by a system of polynomial equations typically derived by using edge-to-edge gains as variables. The output from each sink is equated to its demand to obtain polynomial equations. In this work, we propose a method to derive the polynomial equations using source-to-sink path gains as the variables. In the path gain formulation, we show that linear and quadratic equations suffice; therefore, network coding becomes equivalent to a system of polynomial equations of maximum degree 2. We present algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.1158","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":"0807.1158","created_at":"2026-05-18T00:58:25.514671+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.1158v2","created_at":"2026-05-18T00:58:25.514671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.1158","created_at":"2026-05-18T00:58:25.514671+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUMX65RGS52A","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUMX65RGS52A73VL","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUMX65RG","created_at":"2026-05-18T12:25:58.018023+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/SUMX65RGS52A73VLIWYBCW3RSS","json":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS.json","graph_json":"https://pith.science/api/pith-number/SUMX65RGS52A73VLIWYBCW3RSS/graph.json","events_json":"https://pith.science/api/pith-number/SUMX65RGS52A73VLIWYBCW3RSS/events.json","paper":"https://pith.science/paper/SUMX65RG"},"agent_actions":{"view_html":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS","download_json":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS.json","view_paper":"https://pith.science/paper/SUMX65RG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.1158&json=true","fetch_graph":"https://pith.science/api/pith-number/SUMX65RGS52A73VLIWYBCW3RSS/graph.json","fetch_events":"https://pith.science/api/pith-number/SUMX65RGS52A73VLIWYBCW3RSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS/action/storage_attestation","attest_author":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS/action/author_attestation","sign_citation":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS/action/citation_signature","submit_replication":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS/action/replication_record"}},"created_at":"2026-05-18T00:58:25.514671+00:00","updated_at":"2026-05-18T00:58:25.514671+00:00"}