{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SCWBUHPEMUZ7F7H7ZBDOB2W4UG","short_pith_number":"pith:SCWBUHPE","schema_version":"1.0","canonical_sha256":"90ac1a1de46533f2fcffc846e0eadca1b1dab6db7d3b76f97cfb182a070fae80","source":{"kind":"arxiv","id":"2411.16904","version":1},"attestation_state":"computed","paper":{"title":"On cubic polycirculant 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","submitted_at":"2024-11-25T20:15:27Z","abstract_excerpt":"A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\\ell$-circulant graph is a graph that admits a cyclic group of automorphisms having $\\ell$ vertex orbits of equal size. It is not difficult to observe that there exists no cubic $1$-circulant nut graph or cubic $2$-circulant nut graph, while the full classification of all the cubic $3$-circulant nut graphs was recently obtained [Electron. J. Comb. 31(2) (2024), #2.31]. Here, we investigate the existence of cubic $\\ell$-circulant nut graph"},"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":"2411.16904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T20:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"62483dfade4cb29cb108650d854a7c43f22b7a56176601166ddd343d6f27a6ed","abstract_canon_sha256":"ea19399baf33b36449f280db409b19fe5e0fb100db1a0fc154844443009921d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:52.797404Z","signature_b64":"BNZE+UHswiV03yA6Z8NEhX/esfC5lpaj4qNtmrltbNYq4yRZjp9+vbyF8KvlAb9QCiOGLeMmm+hJhzqMnLdeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90ac1a1de46533f2fcffc846e0eadca1b1dab6db7d3b76f97cfb182a070fae80","last_reissued_at":"2026-07-05T11:16:52.796894Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:52.796894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On cubic polycirculant 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","submitted_at":"2024-11-25T20:15:27Z","abstract_excerpt":"A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\\ell$-circulant graph is a graph that admits a cyclic group of automorphisms having $\\ell$ vertex orbits of equal size. It is not difficult to observe that there exists no cubic $1$-circulant nut graph or cubic $2$-circulant nut graph, while the full classification of all the cubic $3$-circulant nut graphs was recently obtained [Electron. J. Comb. 31(2) (2024), #2.31]. Here, we investigate the existence of cubic $\\ell$-circulant nut graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16904","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/2411.16904/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":"2411.16904","created_at":"2026-07-05T11:16:52.796953+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16904v1","created_at":"2026-07-05T11:16:52.796953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16904","created_at":"2026-07-05T11:16:52.796953+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCWBUHPEMUZ7","created_at":"2026-07-05T11:16:52.796953+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCWBUHPEMUZ7F7H7","created_at":"2026-07-05T11:16:52.796953+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCWBUHPE","created_at":"2026-07-05T11:16:52.796953+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":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG","json":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG.json","graph_json":"https://pith.science/api/pith-number/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/graph.json","events_json":"https://pith.science/api/pith-number/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/events.json","paper":"https://pith.science/paper/SCWBUHPE"},"agent_actions":{"view_html":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG","download_json":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG.json","view_paper":"https://pith.science/paper/SCWBUHPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16904&json=true","fetch_graph":"https://pith.science/api/pith-number/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/graph.json","fetch_events":"https://pith.science/api/pith-number/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/action/storage_attestation","attest_author":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/action/author_attestation","sign_citation":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/action/citation_signature","submit_replication":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/action/replication_record"}},"created_at":"2026-07-05T11:16:52.796953+00:00","updated_at":"2026-07-05T11:16:52.796953+00:00"}