{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VIUFT2NUCF5TN6JAVPCXIMKY3D","short_pith_number":"pith:VIUFT2NU","schema_version":"1.0","canonical_sha256":"aa2859e9b4117b36f920abc5743158d8d8dfa68636d16df126444d77c8b1bc91","source":{"kind":"arxiv","id":"1106.1271","version":2},"attestation_state":"computed","paper":{"title":"The lowest degree $0,1$-polynomial divisible by cyclotomic polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"A.Satyanarayana Reddy","submitted_at":"2011-06-07T07:35:48Z","abstract_excerpt":"Let $n$ be an even positive integer with at most three distinct prime factors and let $\\ze_n$ be a primitive $n$-th root of unity. In this study, we made an attempt to find the lowest-degree $0,1$-polynomial $f(x) \\in \\Q[x]$ having at least three terms such that $f(\\ze_n)$ is a minimal vanishing sum of the $n$-th roots of unity."},"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":"1106.1271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-06-07T07:35:48Z","cross_cats_sorted":[],"title_canon_sha256":"35e5b19cdc2bedbbe12a8a2c76ef9c3841b94721ae38ae50e30d2887c853feb6","abstract_canon_sha256":"71e7945cf17315877d6e68971f91b59e626209903601840c8e0d772a7444b5b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:14.521631Z","signature_b64":"W1mZ+j8a5OBdyz8pZlD1U7myZenBX6K0UZozwfAT8DhGkO+RPetGWnfj7ny/PRS5hUoRcka8ciU+Goxg0drTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa2859e9b4117b36f920abc5743158d8d8dfa68636d16df126444d77c8b1bc91","last_reissued_at":"2026-05-18T04:08:14.521199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:14.521199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The lowest degree $0,1$-polynomial divisible by cyclotomic polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"A.Satyanarayana Reddy","submitted_at":"2011-06-07T07:35:48Z","abstract_excerpt":"Let $n$ be an even positive integer with at most three distinct prime factors and let $\\ze_n$ be a primitive $n$-th root of unity. In this study, we made an attempt to find the lowest-degree $0,1$-polynomial $f(x) \\in \\Q[x]$ having at least three terms such that $f(\\ze_n)$ is a minimal vanishing sum of the $n$-th roots of unity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1271","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":"1106.1271","created_at":"2026-05-18T04:08:14.521272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1271v2","created_at":"2026-05-18T04:08:14.521272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1271","created_at":"2026-05-18T04:08:14.521272+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIUFT2NUCF5T","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIUFT2NUCF5TN6JA","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIUFT2NU","created_at":"2026-05-18T12:26:44.992195+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/VIUFT2NUCF5TN6JAVPCXIMKY3D","json":"https://pith.science/pith/VIUFT2NUCF5TN6JAVPCXIMKY3D.json","graph_json":"https://pith.science/api/pith-number/VIUFT2NUCF5TN6JAVPCXIMKY3D/graph.json","events_json":"https://pith.science/api/pith-number/VIUFT2NUCF5TN6JAVPCXIMKY3D/events.json","paper":"https://pith.science/paper/VIUFT2NU"},"agent_actions":{"view_html":"https://pith.science/pith/VIUFT2NUCF5TN6JAVPCXIMKY3D","download_json":"https://pith.science/pith/VIUFT2NUCF5TN6JAVPCXIMKY3D.json","view_paper":"https://pith.science/paper/VIUFT2NU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1271&json=true","fetch_graph":"https://pith.science/api/pith-number/VIUFT2NUCF5TN6JAVPCXIMKY3D/graph.json","fetch_events":"https://pith.science/api/pith-number/VIUFT2NUCF5TN6JAVPCXIMKY3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIUFT2NUCF5TN6JAVPCXIMKY3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIUFT2NUCF5TN6JAVPCXIMKY3D/action/storage_attestation","attest_author":"https://pith.science/pith/VIUFT2NUCF5TN6JAVPCXIMKY3D/action/author_attestation","sign_citation":"https://pith.science/pith/VIUFT2NUCF5TN6JAVPCXIMKY3D/action/citation_signature","submit_replication":"https://pith.science/pith/VIUFT2NUCF5TN6JAVPCXIMKY3D/action/replication_record"}},"created_at":"2026-05-18T04:08:14.521272+00:00","updated_at":"2026-05-18T04:08:14.521272+00:00"}