{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PJXEB7BJVXT36WG66ZEYOF6TLF","short_pith_number":"pith:PJXEB7BJ","schema_version":"1.0","canonical_sha256":"7a6e40fc29ade7bf58def6498717d35959efad7daf94551f8331d654b3b7a688","source":{"kind":"arxiv","id":"1311.6204","version":2},"attestation_state":"computed","paper":{"title":"Approximating Hereditary Discrepancy via Small Width Ellipsoids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksandar Nikolov, Kunal Talwar","submitted_at":"2013-11-25T03:44:06Z","abstract_excerpt":"The Discrepancy of a hypergraph is the minimum attainable value, over two-colorings of its vertices, of the maximum absolute imbalance of any hyperedge. The Hereditary Discrepancy of a hypergraph, defined as the maximum discrepancy of a restriction of the hypergraph to a subset of its vertices, is a measure of its complexity. Lovasz, Spencer and Vesztergombi (1986) related the natural extension of this quantity to matrices to rounding algorithms for linear programs, and gave a determinant based lower bound on the hereditary discrepancy. Matousek (2011) showed that this bound is tight up to a p"},"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":"1311.6204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-25T03:44:06Z","cross_cats_sorted":[],"title_canon_sha256":"0104922809331c5764aa025ed283e305c68872f4d8c388d6c1fa7b04cc341af2","abstract_canon_sha256":"82e6ed6147cf35d91e71faf64ec6ce145182dd9b9510dd029bbb82eba2ebf9f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:05.592118Z","signature_b64":"OLCEQ6+MCZpxnG2Y1jxvsL7LESceRMQGUGIFhBtHd98rvtIbcHCB6jSACWAuch1tQm6lYxiAQYQ1Mv6xRIjyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a6e40fc29ade7bf58def6498717d35959efad7daf94551f8331d654b3b7a688","last_reissued_at":"2026-05-18T02:47:05.591457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:05.591457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Hereditary Discrepancy via Small Width Ellipsoids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksandar Nikolov, Kunal Talwar","submitted_at":"2013-11-25T03:44:06Z","abstract_excerpt":"The Discrepancy of a hypergraph is the minimum attainable value, over two-colorings of its vertices, of the maximum absolute imbalance of any hyperedge. The Hereditary Discrepancy of a hypergraph, defined as the maximum discrepancy of a restriction of the hypergraph to a subset of its vertices, is a measure of its complexity. Lovasz, Spencer and Vesztergombi (1986) related the natural extension of this quantity to matrices to rounding algorithms for linear programs, and gave a determinant based lower bound on the hereditary discrepancy. Matousek (2011) showed that this bound is tight up to a p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6204","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":"1311.6204","created_at":"2026-05-18T02:47:05.591553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6204v2","created_at":"2026-05-18T02:47:05.591553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6204","created_at":"2026-05-18T02:47:05.591553+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJXEB7BJVXT3","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJXEB7BJVXT36WG6","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJXEB7BJ","created_at":"2026-05-18T12:27:54.935989+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/PJXEB7BJVXT36WG66ZEYOF6TLF","json":"https://pith.science/pith/PJXEB7BJVXT36WG66ZEYOF6TLF.json","graph_json":"https://pith.science/api/pith-number/PJXEB7BJVXT36WG66ZEYOF6TLF/graph.json","events_json":"https://pith.science/api/pith-number/PJXEB7BJVXT36WG66ZEYOF6TLF/events.json","paper":"https://pith.science/paper/PJXEB7BJ"},"agent_actions":{"view_html":"https://pith.science/pith/PJXEB7BJVXT36WG66ZEYOF6TLF","download_json":"https://pith.science/pith/PJXEB7BJVXT36WG66ZEYOF6TLF.json","view_paper":"https://pith.science/paper/PJXEB7BJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6204&json=true","fetch_graph":"https://pith.science/api/pith-number/PJXEB7BJVXT36WG66ZEYOF6TLF/graph.json","fetch_events":"https://pith.science/api/pith-number/PJXEB7BJVXT36WG66ZEYOF6TLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJXEB7BJVXT36WG66ZEYOF6TLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJXEB7BJVXT36WG66ZEYOF6TLF/action/storage_attestation","attest_author":"https://pith.science/pith/PJXEB7BJVXT36WG66ZEYOF6TLF/action/author_attestation","sign_citation":"https://pith.science/pith/PJXEB7BJVXT36WG66ZEYOF6TLF/action/citation_signature","submit_replication":"https://pith.science/pith/PJXEB7BJVXT36WG66ZEYOF6TLF/action/replication_record"}},"created_at":"2026-05-18T02:47:05.591553+00:00","updated_at":"2026-05-18T02:47:05.591553+00:00"}