{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DUX33DR3KYEYGIDLGSHJBZ5R35","short_pith_number":"pith:DUX33DR3","schema_version":"1.0","canonical_sha256":"1d2fbd8e3b560983206b348e90e7b1df7dc576ef22351e073a62a802fa0a2723","source":{"kind":"arxiv","id":"1607.00490","version":1},"attestation_state":"computed","paper":{"title":"Scalar Solvability of Network Computation Problems and Representable Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anindya Gupta, B. Sundar Rajan","submitted_at":"2016-07-02T11:08:24Z","abstract_excerpt":"We consider the following \\textit{network computation problem}. In an acyclic network, there are multiple source nodes, each generating multiple messages, and there are multiple sink nodes, each demanding a function of the source messages. The network coding problem corresponds to the case in which every demand function is equal to some source message, i.e., each sink demands some source message. Connections between network coding problems and matroids have been well studied. In this work, we establish a relation between network computation problems and representable matroids. We show that a n"},"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":"1607.00490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-02T11:08:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d39f7a58a1666c0ff7c5c8f659c354607438be115b0dddb352b826746320e61a","abstract_canon_sha256":"762f72b3b661fa774e87257534ff57b98f321c4ecfcbf58d53e176400a7957a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:36.962485Z","signature_b64":"r7edI+b4R5UM/3P0UMWQYkSm9DcBYg+3sHqzwQexw0UPt48s9C7xnVRF2uJnI5YhFwuqNBi481r28uSLL3nzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d2fbd8e3b560983206b348e90e7b1df7dc576ef22351e073a62a802fa0a2723","last_reissued_at":"2026-05-18T01:11:36.962124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:36.962124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalar Solvability of Network Computation Problems and Representable Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anindya Gupta, B. Sundar Rajan","submitted_at":"2016-07-02T11:08:24Z","abstract_excerpt":"We consider the following \\textit{network computation problem}. In an acyclic network, there are multiple source nodes, each generating multiple messages, and there are multiple sink nodes, each demanding a function of the source messages. The network coding problem corresponds to the case in which every demand function is equal to some source message, i.e., each sink demands some source message. Connections between network coding problems and matroids have been well studied. In this work, we establish a relation between network computation problems and representable matroids. We show that a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00490","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":"1607.00490","created_at":"2026-05-18T01:11:36.962185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00490v1","created_at":"2026-05-18T01:11:36.962185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00490","created_at":"2026-05-18T01:11:36.962185+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUX33DR3KYEY","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUX33DR3KYEYGIDL","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUX33DR3","created_at":"2026-05-18T12:30:12.583610+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/DUX33DR3KYEYGIDLGSHJBZ5R35","json":"https://pith.science/pith/DUX33DR3KYEYGIDLGSHJBZ5R35.json","graph_json":"https://pith.science/api/pith-number/DUX33DR3KYEYGIDLGSHJBZ5R35/graph.json","events_json":"https://pith.science/api/pith-number/DUX33DR3KYEYGIDLGSHJBZ5R35/events.json","paper":"https://pith.science/paper/DUX33DR3"},"agent_actions":{"view_html":"https://pith.science/pith/DUX33DR3KYEYGIDLGSHJBZ5R35","download_json":"https://pith.science/pith/DUX33DR3KYEYGIDLGSHJBZ5R35.json","view_paper":"https://pith.science/paper/DUX33DR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00490&json=true","fetch_graph":"https://pith.science/api/pith-number/DUX33DR3KYEYGIDLGSHJBZ5R35/graph.json","fetch_events":"https://pith.science/api/pith-number/DUX33DR3KYEYGIDLGSHJBZ5R35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUX33DR3KYEYGIDLGSHJBZ5R35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUX33DR3KYEYGIDLGSHJBZ5R35/action/storage_attestation","attest_author":"https://pith.science/pith/DUX33DR3KYEYGIDLGSHJBZ5R35/action/author_attestation","sign_citation":"https://pith.science/pith/DUX33DR3KYEYGIDLGSHJBZ5R35/action/citation_signature","submit_replication":"https://pith.science/pith/DUX33DR3KYEYGIDLGSHJBZ5R35/action/replication_record"}},"created_at":"2026-05-18T01:11:36.962185+00:00","updated_at":"2026-05-18T01:11:36.962185+00:00"}