{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CQER6FQTG5CEVSLQLOIR454VIO","short_pith_number":"pith:CQER6FQT","schema_version":"1.0","canonical_sha256":"14091f161337444ac9705b911e77954391e235f3572bd34d14a156319303e4c6","source":{"kind":"arxiv","id":"1506.06743","version":1},"attestation_state":"computed","paper":{"title":"Fattening up Warning's Second Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.NT"],"primary_cat":"math.CO","authors_text":"Pete L. Clark","submitted_at":"2015-06-20T20:11:11Z","abstract_excerpt":"We present a generalization of Warning's Second Theorem to polynomial systems over a finite local principal ring with suitably restricted input and output variables. This generalizes a recent result with Forrow and Schmitt (and gives a new proof of that result). Applications to additive group theory, graph theory and polynomial interpolation are pursued in detail."},"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":"1506.06743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-20T20:11:11Z","cross_cats_sorted":["math.AC","math.NT"],"title_canon_sha256":"3580309bd0dc363df1d35830049f3d3912be1e91c5ae98690adb4ae7d3b7b727","abstract_canon_sha256":"59b52101c52aa6917f1fb88088b8e3dcfc1878af9991aa7c86927855eab987e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:57.760918Z","signature_b64":"Bt/uSHsKp/8oslM0TwS2e0Qx8FAa8SRb8ZDTb24DZKZNkiTfvv9aUBxOHqZN/weYT7RrwNeJ90BkwyMPn9xuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14091f161337444ac9705b911e77954391e235f3572bd34d14a156319303e4c6","last_reissued_at":"2026-05-18T01:40:57.760387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:57.760387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fattening up Warning's Second Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.NT"],"primary_cat":"math.CO","authors_text":"Pete L. Clark","submitted_at":"2015-06-20T20:11:11Z","abstract_excerpt":"We present a generalization of Warning's Second Theorem to polynomial systems over a finite local principal ring with suitably restricted input and output variables. This generalizes a recent result with Forrow and Schmitt (and gives a new proof of that result). Applications to additive group theory, graph theory and polynomial interpolation are pursued in detail."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06743","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":"1506.06743","created_at":"2026-05-18T01:40:57.760463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06743v1","created_at":"2026-05-18T01:40:57.760463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06743","created_at":"2026-05-18T01:40:57.760463+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQER6FQTG5CE","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQER6FQTG5CEVSLQ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQER6FQT","created_at":"2026-05-18T12:29:17.054201+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/CQER6FQTG5CEVSLQLOIR454VIO","json":"https://pith.science/pith/CQER6FQTG5CEVSLQLOIR454VIO.json","graph_json":"https://pith.science/api/pith-number/CQER6FQTG5CEVSLQLOIR454VIO/graph.json","events_json":"https://pith.science/api/pith-number/CQER6FQTG5CEVSLQLOIR454VIO/events.json","paper":"https://pith.science/paper/CQER6FQT"},"agent_actions":{"view_html":"https://pith.science/pith/CQER6FQTG5CEVSLQLOIR454VIO","download_json":"https://pith.science/pith/CQER6FQTG5CEVSLQLOIR454VIO.json","view_paper":"https://pith.science/paper/CQER6FQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06743&json=true","fetch_graph":"https://pith.science/api/pith-number/CQER6FQTG5CEVSLQLOIR454VIO/graph.json","fetch_events":"https://pith.science/api/pith-number/CQER6FQTG5CEVSLQLOIR454VIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQER6FQTG5CEVSLQLOIR454VIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQER6FQTG5CEVSLQLOIR454VIO/action/storage_attestation","attest_author":"https://pith.science/pith/CQER6FQTG5CEVSLQLOIR454VIO/action/author_attestation","sign_citation":"https://pith.science/pith/CQER6FQTG5CEVSLQLOIR454VIO/action/citation_signature","submit_replication":"https://pith.science/pith/CQER6FQTG5CEVSLQLOIR454VIO/action/replication_record"}},"created_at":"2026-05-18T01:40:57.760463+00:00","updated_at":"2026-05-18T01:40:57.760463+00:00"}