{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KKGKWZHZT6D44WF7BAMFKJBUBA","short_pith_number":"pith:KKGKWZHZ","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"},"canonical_sha256":"528cab64f99f87ce58bf08185524340804b4df35a37fb2a56b65b63c34a7d1f2","source":{"kind":"arxiv","id":"1509.07588","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07588","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07588v2","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07588","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"KKGKWZHZT6D4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KKGKWZHZT6D44WF7","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KKGKWZHZ","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KKGKWZHZT6D44WF7BAMFKJBUBA","target":"record","payload":{"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"},"canonical_sha256":"528cab64f99f87ce58bf08185524340804b4df35a37fb2a56b65b63c34a7d1f2","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"},"source_kind":"arxiv","source_id":"1509.07588","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-18T01:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9q4ffSFNKUGC8y/M6BZS8chRpQx825uYy7wbeXHydTVSctUjLk6VfHU3xd+PiF8pqNsCDXcC5MSSxUzNJ58KCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:46:58.172493Z"},"content_sha256":"dedd6f8a4c053d320768d55d1bcb73ce573a089644c702b1fe53bcb3eb19d380","schema_version":"1.0","event_id":"sha256:dedd6f8a4c053d320768d55d1bcb73ce573a089644c702b1fe53bcb3eb19d380"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KKGKWZHZT6D44WF7BAMFKJBUBA","target":"graph","payload":{"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"},"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-18T01:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kq8eYu6xaEGBrPDTPkN37Jx6AC6oDA6AvUVa7STWkrwq/m9JRRFgP6b6ur8ybVnh20UEW3HWjW8P6K/ptizRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:46:58.173060Z"},"content_sha256":"c14f439f90235fe086633b54d876f56c4c03397e33f3359f9c739ac11b1ba0d8","schema_version":"1.0","event_id":"sha256:c14f439f90235fe086633b54d876f56c4c03397e33f3359f9c739ac11b1ba0d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA/bundle.json","state_url":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKGKWZHZT6D44WF7BAMFKJBUBA/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-05T05:46:58Z","links":{"resolver":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA","bundle":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA/bundle.json","state":"https://pith.science/pith/KKGKWZHZT6D44WF7BAMFKJBUBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKGKWZHZT6D44WF7BAMFKJBUBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KKGKWZHZT6D44WF7BAMFKJBUBA","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":"05445cab5163059dee5f560669e932ff1602fe3a7b2ff7b675ed86c360c871d0","cross_cats_sorted":["cs.FL","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-25T05:29:18Z","title_canon_sha256":"6144955721876ad10b88627ea11911aca58c9725b7903b505caa33e4d4a16eca"},"schema_version":"1.0","source":{"id":"1509.07588","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07588","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07588v2","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07588","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"KKGKWZHZT6D4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KKGKWZHZT6D44WF7","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KKGKWZHZ","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:c14f439f90235fe086633b54d876f56c4c03397e33f3359f9c739ac11b1ba0d8","target":"graph","created_at":"2026-05-18T01:14:29Z","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":"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 ","authors_text":"Anna Lubiw, Dmitry Chistikov, Jeffrey Shallit, Szabolcs Iv\\'an","cross_cats":["cs.FL","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-25T05:29:18Z","title":"Fractional coverings, greedy coverings, and rectifier networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07588","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:dedd6f8a4c053d320768d55d1bcb73ce573a089644c702b1fe53bcb3eb19d380","target":"record","created_at":"2026-05-18T01:14:29Z","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":"05445cab5163059dee5f560669e932ff1602fe3a7b2ff7b675ed86c360c871d0","cross_cats_sorted":["cs.FL","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-25T05:29:18Z","title_canon_sha256":"6144955721876ad10b88627ea11911aca58c9725b7903b505caa33e4d4a16eca"},"schema_version":"1.0","source":{"id":"1509.07588","kind":"arxiv","version":2}},"canonical_sha256":"528cab64f99f87ce58bf08185524340804b4df35a37fb2a56b65b63c34a7d1f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"528cab64f99f87ce58bf08185524340804b4df35a37fb2a56b65b63c34a7d1f2","first_computed_at":"2026-05-18T01:14:29.262621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:29.262621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ZlifdH1Lo3HZCInXdi42AwhdNXSQwxSS8loP088uU98TUGNB7WjCwLd/XsHzIGeEDGj6t3JgLRhxeMit6ymAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:29.263254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07588","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dedd6f8a4c053d320768d55d1bcb73ce573a089644c702b1fe53bcb3eb19d380","sha256:c14f439f90235fe086633b54d876f56c4c03397e33f3359f9c739ac11b1ba0d8"],"state_sha256":"23f2cec52dcb15b50c3199598e4daae3cda35405f088a7c3622d363089f18a58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oKN365QdsWOpMLMFwD0ulw2TB5k5awgQZLDdhBT7RnHPSWn1gvJ9iHy0/TlR6oza+Xgp7ILoQeABUlXCfJwSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:46:58.177131Z","bundle_sha256":"31269768ff8e712b28a894623d42821ce3d4e70ccfe16c44e7fd32f218e70f08"}}