{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QELDYJH3VQO2QBAOGDQHOSNPND","short_pith_number":"pith:QELDYJH3","schema_version":"1.0","canonical_sha256":"81163c24fbac1da8040e30e07749af68d28a9d7bcd099869afc252b91d727ad9","source":{"kind":"arxiv","id":"2305.18658","version":1},"attestation_state":"computed","paper":{"title":"A note on Cayley nut graphs whose degree is divisible by four","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ivan Damnjanovi\\'c","submitted_at":"2023-05-29T23:45:40Z","abstract_excerpt":"A nut graph is a non-trivial simple graph such that its adjacency matrix has a one-dimensional null space spanned by a full vector. It was recently shown by the authors that there exists a $d$-regular circulant nut graph of order $n$ if and only if $4 \\mid d, \\, 2 \\mid n, \\, d > 0$, together with $n \\ge d + 4$ if $d \\equiv_8 4$ and $n \\ge d + 6$ if $8 \\mid d$, as well as $(n, d) \\neq (16, 8)$ [arXiv:2212.03026, 2022]. In this paper, we demonstrate the existence of a $d$-regular Cayley nut graph of order $n$ for each $4 \\mid d, \\, d > 0$ and $2 \\mid n, \\, n \\ge d + 4$, thereby resolving the exi"},"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":"2305.18658","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-29T23:45:40Z","cross_cats_sorted":[],"title_canon_sha256":"291ae256d8fac1173bc7fb72b803bcd798180e06675da2d337af75fef31778ae","abstract_canon_sha256":"d88252e724a8a798379b1fbc59b6e96d4ed4522d6832eb29307c1065346f24eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:15:03.429782Z","signature_b64":"qNR5iWCfKAcGtUOR41GzIuhx1Q09uYGLplNzysD8HCK5/cLRZlJJ4Kk1nmIjDM77Uw59xr/Z6Q9jIol1aXr9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81163c24fbac1da8040e30e07749af68d28a9d7bcd099869afc252b91d727ad9","last_reissued_at":"2026-07-05T06:15:03.429312Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:15:03.429312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on Cayley nut graphs whose degree is divisible by four","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ivan Damnjanovi\\'c","submitted_at":"2023-05-29T23:45:40Z","abstract_excerpt":"A nut graph is a non-trivial simple graph such that its adjacency matrix has a one-dimensional null space spanned by a full vector. It was recently shown by the authors that there exists a $d$-regular circulant nut graph of order $n$ if and only if $4 \\mid d, \\, 2 \\mid n, \\, d > 0$, together with $n \\ge d + 4$ if $d \\equiv_8 4$ and $n \\ge d + 6$ if $8 \\mid d$, as well as $(n, d) \\neq (16, 8)$ [arXiv:2212.03026, 2022]. In this paper, we demonstrate the existence of a $d$-regular Cayley nut graph of order $n$ for each $4 \\mid d, \\, d > 0$ and $2 \\mid n, \\, n \\ge d + 4$, thereby resolving the exi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18658","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.18658/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":"2305.18658","created_at":"2026-07-05T06:15:03.429375+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.18658v1","created_at":"2026-07-05T06:15:03.429375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18658","created_at":"2026-07-05T06:15:03.429375+00:00"},{"alias_kind":"pith_short_12","alias_value":"QELDYJH3VQO2","created_at":"2026-07-05T06:15:03.429375+00:00"},{"alias_kind":"pith_short_16","alias_value":"QELDYJH3VQO2QBAO","created_at":"2026-07-05T06:15:03.429375+00:00"},{"alias_kind":"pith_short_8","alias_value":"QELDYJH3","created_at":"2026-07-05T06:15:03.429375+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":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QELDYJH3VQO2QBAOGDQHOSNPND","json":"https://pith.science/pith/QELDYJH3VQO2QBAOGDQHOSNPND.json","graph_json":"https://pith.science/api/pith-number/QELDYJH3VQO2QBAOGDQHOSNPND/graph.json","events_json":"https://pith.science/api/pith-number/QELDYJH3VQO2QBAOGDQHOSNPND/events.json","paper":"https://pith.science/paper/QELDYJH3"},"agent_actions":{"view_html":"https://pith.science/pith/QELDYJH3VQO2QBAOGDQHOSNPND","download_json":"https://pith.science/pith/QELDYJH3VQO2QBAOGDQHOSNPND.json","view_paper":"https://pith.science/paper/QELDYJH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.18658&json=true","fetch_graph":"https://pith.science/api/pith-number/QELDYJH3VQO2QBAOGDQHOSNPND/graph.json","fetch_events":"https://pith.science/api/pith-number/QELDYJH3VQO2QBAOGDQHOSNPND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QELDYJH3VQO2QBAOGDQHOSNPND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QELDYJH3VQO2QBAOGDQHOSNPND/action/storage_attestation","attest_author":"https://pith.science/pith/QELDYJH3VQO2QBAOGDQHOSNPND/action/author_attestation","sign_citation":"https://pith.science/pith/QELDYJH3VQO2QBAOGDQHOSNPND/action/citation_signature","submit_replication":"https://pith.science/pith/QELDYJH3VQO2QBAOGDQHOSNPND/action/replication_record"}},"created_at":"2026-07-05T06:15:03.429375+00:00","updated_at":"2026-07-05T06:15:03.429375+00:00"}