{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RK3KW6ANYUEDBT4DDHGELCEBGL","short_pith_number":"pith:RK3KW6AN","schema_version":"1.0","canonical_sha256":"8ab6ab780dc50830cf8319cc45888132cd4b33b5651e271264b6f8a1906e2798","source":{"kind":"arxiv","id":"1903.08571","version":1},"attestation_state":"computed","paper":{"title":"Identifying Maximal Non-Redundant Integer Cone Generators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ruzica Piskac, Slobodan Mitrovi\\'c, Viktor Kun\\v{c}ak","submitted_at":"2019-03-20T15:55:48Z","abstract_excerpt":"A non-redundant integer cone generator (NICG) of dimension $d$ is a set $S$ of vectors from $\\{0,1\\}^d$ whose vector sum cannot be generated as a positive integer linear combination of a proper subset of $S$. The largest possible cardinality of NICG of a dimension $d$, denoted by $N(d)$, provides an upper bound on the sparsity of systems of integer equations with a large number of integer variables. A better estimate of $N(d)$ means that we can consider smaller sub-systems of integer equations when solving systems with many integer variables. Furthermore, given that we can reduce constraints o"},"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":"1903.08571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-03-20T15:55:48Z","cross_cats_sorted":[],"title_canon_sha256":"9348b465781c48191450d4cfd2b507e6b2180fbbda7345a96e93886674bf5b66","abstract_canon_sha256":"b96727e6c3928e2b33bad61102efef5707dfd0d2d556401c9fa9e7888f28ebfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:47.717160Z","signature_b64":"xU8h8gPhue1XapqpKbGFfa+wZTCHiV4A7x5zpFrF4L88luFOlgz8hm5JVQF7mD5wb05t10L544/GTEtRbjUaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ab6ab780dc50830cf8319cc45888132cd4b33b5651e271264b6f8a1906e2798","last_reissued_at":"2026-05-17T23:50:47.716427Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:47.716427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying Maximal Non-Redundant Integer Cone Generators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ruzica Piskac, Slobodan Mitrovi\\'c, Viktor Kun\\v{c}ak","submitted_at":"2019-03-20T15:55:48Z","abstract_excerpt":"A non-redundant integer cone generator (NICG) of dimension $d$ is a set $S$ of vectors from $\\{0,1\\}^d$ whose vector sum cannot be generated as a positive integer linear combination of a proper subset of $S$. The largest possible cardinality of NICG of a dimension $d$, denoted by $N(d)$, provides an upper bound on the sparsity of systems of integer equations with a large number of integer variables. A better estimate of $N(d)$ means that we can consider smaller sub-systems of integer equations when solving systems with many integer variables. Furthermore, given that we can reduce constraints o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08571","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":"1903.08571","created_at":"2026-05-17T23:50:47.716556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.08571v1","created_at":"2026-05-17T23:50:47.716556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08571","created_at":"2026-05-17T23:50:47.716556+00:00"},{"alias_kind":"pith_short_12","alias_value":"RK3KW6ANYUED","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RK3KW6ANYUEDBT4D","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RK3KW6AN","created_at":"2026-05-18T12:33:27.125529+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/RK3KW6ANYUEDBT4DDHGELCEBGL","json":"https://pith.science/pith/RK3KW6ANYUEDBT4DDHGELCEBGL.json","graph_json":"https://pith.science/api/pith-number/RK3KW6ANYUEDBT4DDHGELCEBGL/graph.json","events_json":"https://pith.science/api/pith-number/RK3KW6ANYUEDBT4DDHGELCEBGL/events.json","paper":"https://pith.science/paper/RK3KW6AN"},"agent_actions":{"view_html":"https://pith.science/pith/RK3KW6ANYUEDBT4DDHGELCEBGL","download_json":"https://pith.science/pith/RK3KW6ANYUEDBT4DDHGELCEBGL.json","view_paper":"https://pith.science/paper/RK3KW6AN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.08571&json=true","fetch_graph":"https://pith.science/api/pith-number/RK3KW6ANYUEDBT4DDHGELCEBGL/graph.json","fetch_events":"https://pith.science/api/pith-number/RK3KW6ANYUEDBT4DDHGELCEBGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RK3KW6ANYUEDBT4DDHGELCEBGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RK3KW6ANYUEDBT4DDHGELCEBGL/action/storage_attestation","attest_author":"https://pith.science/pith/RK3KW6ANYUEDBT4DDHGELCEBGL/action/author_attestation","sign_citation":"https://pith.science/pith/RK3KW6ANYUEDBT4DDHGELCEBGL/action/citation_signature","submit_replication":"https://pith.science/pith/RK3KW6ANYUEDBT4DDHGELCEBGL/action/replication_record"}},"created_at":"2026-05-17T23:50:47.716556+00:00","updated_at":"2026-05-17T23:50:47.716556+00:00"}