{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KKGKWZHZT6D44WF7BAMFKJBUBA","short_pith_number":"pith:KKGKWZHZ","schema_version":"1.0","canonical_sha256":"528cab64f99f87ce58bf08185524340804b4df35a37fb2a56b65b63c34a7d1f2","source":{"kind":"arxiv","id":"1509.07588","version":2},"attestation_state":"computed","paper":{"title":"Fractional coverings, greedy coverings, and rectifier networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.CO"],"primary_cat":"cs.CC","authors_text":"Anna Lubiw, Dmitry Chistikov, Jeffrey Shallit, Szabolcs Iv\\'an","submitted_at":"2015-09-25T05:29:18Z","abstract_excerpt":"A rectifier network is a directed acyclic graph with distinguished sources and sinks; it is said to compute a Boolean matrix $M$ that has a $1$ in the entry $(i,j)$ iff there is a path from the $j$th source to the $i$th sink. The smallest number of edges in a rectifier network computing $M$ is a classic complexity measure on matrices, which has been studied for more than half a century.\n  We explore two well-known techniques that have hitherto found little to no applications in this theory. Both of them build on a basic fact that depth-$2$ rectifier networks are essentially weighted coverings "},"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":"1509.07588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-25T05:29:18Z","cross_cats_sorted":["cs.FL","math.CO"],"title_canon_sha256":"6144955721876ad10b88627ea11911aca58c9725b7903b505caa33e4d4a16eca","abstract_canon_sha256":"05445cab5163059dee5f560669e932ff1602fe3a7b2ff7b675ed86c360c871d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:29.263254Z","signature_b64":"1ZlifdH1Lo3HZCInXdi42AwhdNXSQwxSS8loP088uU98TUGNB7WjCwLd/XsHzIGeEDGj6t3JgLRhxeMit6ymAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"528cab64f99f87ce58bf08185524340804b4df35a37fb2a56b65b63c34a7d1f2","last_reissued_at":"2026-05-18T01:14:29.262621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:29.262621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fractional coverings, greedy coverings, and rectifier networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.CO"],"primary_cat":"cs.CC","authors_text":"Anna Lubiw, Dmitry Chistikov, Jeffrey Shallit, Szabolcs Iv\\'an","submitted_at":"2015-09-25T05:29:18Z","abstract_excerpt":"A rectifier network is a directed acyclic graph with distinguished sources and sinks; it is said to compute a Boolean matrix $M$ that has a $1$ in the entry $(i,j)$ iff there is a path from the $j$th source to the $i$th sink. The smallest number of edges in a rectifier network computing $M$ is a classic complexity measure on matrices, which has been studied for more than half a century.\n  We explore two well-known techniques that have hitherto found little to no applications in this theory. Both of them build on a basic fact that depth-$2$ rectifier networks are essentially weighted coverings "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07588","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":"1509.07588","created_at":"2026-05-18T01:14:29.262717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07588v2","created_at":"2026-05-18T01:14:29.262717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07588","created_at":"2026-05-18T01:14:29.262717+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKGKWZHZT6D4","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKGKWZHZT6D44WF7","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKGKWZHZ","created_at":"2026-05-18T12:29:29.992203+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/KKGKWZHZT6D44WF7BAMFKJBUBA","json":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA.json","graph_json":"https://pith.science/api/pith-number/KKGKWZHZT6D44WF7BAMFKJBUBA/graph.json","events_json":"https://pith.science/api/pith-number/KKGKWZHZT6D44WF7BAMFKJBUBA/events.json","paper":"https://pith.science/paper/KKGKWZHZ"},"agent_actions":{"view_html":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA","download_json":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA.json","view_paper":"https://pith.science/paper/KKGKWZHZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07588&json=true","fetch_graph":"https://pith.science/api/pith-number/KKGKWZHZT6D44WF7BAMFKJBUBA/graph.json","fetch_events":"https://pith.science/api/pith-number/KKGKWZHZT6D44WF7BAMFKJBUBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA/action/storage_attestation","attest_author":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA/action/author_attestation","sign_citation":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA/action/citation_signature","submit_replication":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA/action/replication_record"}},"created_at":"2026-05-18T01:14:29.262717+00:00","updated_at":"2026-05-18T01:14:29.262717+00:00"}