{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FVWDZ3JQRBMSXJTFE47BBG25TN","short_pith_number":"pith:FVWDZ3JQ","schema_version":"1.0","canonical_sha256":"2d6c3ced3088592ba665273e109b5d9b4776b2eafa6f5abbd76b9da73688ef97","source":{"kind":"arxiv","id":"2410.14063","version":2},"attestation_state":"computed","paper":{"title":"On the degrees of regular nut graphs and Cayley nut graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ivan Damnjanovi\\'c, Nino Ba\\v{s}i\\'c, Patrick W. Fowler","submitted_at":"2024-10-17T22:16:27Z","abstract_excerpt":"A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. It is known that infinitely many $d$-regular nut graphs exist for $3 \\leq d \\leq 12$ and for $d \\geq 4$ such that $d \\equiv 0 \\pmod{4}$. Here it is shown that infinitely many $d$-regular nut graphs exist for each degree $d \\geq 3$. Moreover, we prove that there are infinitely many $d$-regular Cayley nut graphs for each even $d \\ge 4$. This implies that we have identified all feasible degrees $d$ for which a $d$-regular Cayley nut graph exists."},"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":"2410.14063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-17T22:16:27Z","cross_cats_sorted":[],"title_canon_sha256":"26a46e876e5ac5396d225438ee12a3cc5831eeb907db928e2f93eb2cffe25fba","abstract_canon_sha256":"b23c69971e371584e2269b311d167cc64f1707a2218873b7d44b33cb3ab8499b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:39.919231Z","signature_b64":"c7NUt1JpwKRAfqP06AJqNe+ZiZrUpBLoRagmGUnC/u0rJC3GhA1bSB896bnUScmuJnPCumpgPkAs9p/xIgIjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d6c3ced3088592ba665273e109b5d9b4776b2eafa6f5abbd76b9da73688ef97","last_reissued_at":"2026-07-05T11:15:39.918818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:39.918818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the degrees of regular nut graphs and Cayley nut graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ivan Damnjanovi\\'c, Nino Ba\\v{s}i\\'c, Patrick W. Fowler","submitted_at":"2024-10-17T22:16:27Z","abstract_excerpt":"A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. It is known that infinitely many $d$-regular nut graphs exist for $3 \\leq d \\leq 12$ and for $d \\geq 4$ such that $d \\equiv 0 \\pmod{4}$. Here it is shown that infinitely many $d$-regular nut graphs exist for each degree $d \\geq 3$. Moreover, we prove that there are infinitely many $d$-regular Cayley nut graphs for each even $d \\ge 4$. This implies that we have identified all feasible degrees $d$ for which a $d$-regular Cayley nut graph exists."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.14063","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.14063/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.14063","created_at":"2026-07-05T11:15:39.918869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.14063v2","created_at":"2026-07-05T11:15:39.918869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14063","created_at":"2026-07-05T11:15:39.918869+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVWDZ3JQRBMS","created_at":"2026-07-05T11:15:39.918869+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVWDZ3JQRBMSXJTF","created_at":"2026-07-05T11:15:39.918869+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVWDZ3JQ","created_at":"2026-07-05T11:15:39.918869+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06353","citing_title":"Classification of quartic bicirculant nut graphs","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN","json":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN.json","graph_json":"https://pith.science/api/pith-number/FVWDZ3JQRBMSXJTFE47BBG25TN/graph.json","events_json":"https://pith.science/api/pith-number/FVWDZ3JQRBMSXJTFE47BBG25TN/events.json","paper":"https://pith.science/paper/FVWDZ3JQ"},"agent_actions":{"view_html":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN","download_json":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN.json","view_paper":"https://pith.science/paper/FVWDZ3JQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.14063&json=true","fetch_graph":"https://pith.science/api/pith-number/FVWDZ3JQRBMSXJTFE47BBG25TN/graph.json","fetch_events":"https://pith.science/api/pith-number/FVWDZ3JQRBMSXJTFE47BBG25TN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN/action/storage_attestation","attest_author":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN/action/author_attestation","sign_citation":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN/action/citation_signature","submit_replication":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN/action/replication_record"}},"created_at":"2026-07-05T11:15:39.918869+00:00","updated_at":"2026-07-05T11:15:39.918869+00:00"}