{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:SUMX65RGS52A73VLIWYBCW3RSS","short_pith_number":"pith:SUMX65RG","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"},"canonical_sha256":"95197f762697740feeab45b0115b7194846db695701e937dd5e4b2ddb49594a9","source":{"kind":"arxiv","id":"0807.1158","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.1158","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0807.1158v2","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.1158","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"SUMX65RGS52A","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"SUMX65RGS52A73VL","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"SUMX65RG","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:SUMX65RGS52A73VLIWYBCW3RSS","target":"record","payload":{"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"},"canonical_sha256":"95197f762697740feeab45b0115b7194846db695701e937dd5e4b2ddb49594a9","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"},"source_kind":"arxiv","source_id":"0807.1158","source_version":2,"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-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhcOstsyltPJiI8WjUpxVqvw2Kxyz6fYR1lPBwNkVGgjh2TjhlaccOjzJg07EhPDp1TGqUrVtSAGlHB8cSFcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:55:24.838275Z"},"content_sha256":"b908551ca271cfd11c16ddb072794597d435c266a107111458dbb52ca4ba812a","schema_version":"1.0","event_id":"sha256:b908551ca271cfd11c16ddb072794597d435c266a107111458dbb52ca4ba812a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:SUMX65RGS52A73VLIWYBCW3RSS","target":"graph","payload":{"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"},"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-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ynrOSUMw/vBcECAHc1YQ6904HRLOHI4rrR9cQ1AiQTrWVwFa8F8agbdTmt7vMXBxF+fkypzAbGzhKs7yPEhcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:55:24.839108Z"},"content_sha256":"d1ee220b33d4428b75720571a1a009a62a31a40dc1ed59476bd744cd76920775","schema_version":"1.0","event_id":"sha256:d1ee220b33d4428b75720571a1a009a62a31a40dc1ed59476bd744cd76920775"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS/bundle.json","state_url":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SUMX65RGS52A73VLIWYBCW3RSS/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-08T15:55:24Z","links":{"resolver":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS","bundle":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS/bundle.json","state":"https://pith.science/pith/SUMX65RGS52A73VLIWYBCW3RSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SUMX65RGS52A73VLIWYBCW3RSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:SUMX65RGS52A73VLIWYBCW3RSS","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":"47b086ab7811490a7e9c5900a01bad5a92831c01d660d11b576a41df4ced0522","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-07-08T02:51:49Z","title_canon_sha256":"acab5da6a142d5f45b2a2468e8ebd3a4cc1589c872514f1961b0114bc98ba2de"},"schema_version":"1.0","source":{"id":"0807.1158","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.1158","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0807.1158v2","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.1158","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"SUMX65RGS52A","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"SUMX65RGS52A73VL","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"SUMX65RG","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:d1ee220b33d4428b75720571a1a009a62a31a40dc1ed59476bd744cd76920775","target":"graph","created_at":"2026-05-18T00:58:25Z","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":"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 ","authors_text":"Abhay T. Subramanian, Andrew Thangaraj","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-07-08T02:51:49Z","title":"Path Gain Algebraic Formulation for the Scalar Linear Network Coding Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.1158","kind":"arxiv","version":2},"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:b908551ca271cfd11c16ddb072794597d435c266a107111458dbb52ca4ba812a","target":"record","created_at":"2026-05-18T00:58:25Z","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":"47b086ab7811490a7e9c5900a01bad5a92831c01d660d11b576a41df4ced0522","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-07-08T02:51:49Z","title_canon_sha256":"acab5da6a142d5f45b2a2468e8ebd3a4cc1589c872514f1961b0114bc98ba2de"},"schema_version":"1.0","source":{"id":"0807.1158","kind":"arxiv","version":2}},"canonical_sha256":"95197f762697740feeab45b0115b7194846db695701e937dd5e4b2ddb49594a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95197f762697740feeab45b0115b7194846db695701e937dd5e4b2ddb49594a9","first_computed_at":"2026-05-18T00:58:25.514557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:25.514557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QW3KuKykJFurRevabjz97o1P1/3wWXs+z0QzqqVrARVfOPR6ler2It/avEKJoDMfqs/c5TsV4KxxplpmdhsYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:25.515239Z","signed_message":"canonical_sha256_bytes"},"source_id":"0807.1158","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b908551ca271cfd11c16ddb072794597d435c266a107111458dbb52ca4ba812a","sha256:d1ee220b33d4428b75720571a1a009a62a31a40dc1ed59476bd744cd76920775"],"state_sha256":"87fff962795122730dea3eb90c7ca417d0cf46b54937e783d349fa1e87ae5523"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1XP4JZn9nURhXpmhFl2jMbd+sbMydHTjTrdzAiF4yo/3PTzDRmgD9rnfEZ2LTruTGa6domB5o+haJAqyALiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:55:24.843730Z","bundle_sha256":"57c2cab11d9be423e0c6d42b71ccb2678812fa0bc200045a0daeb08cd091cf9a"}}