{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SCWBUHPEMUZ7F7H7ZBDOB2W4UG","short_pith_number":"pith:SCWBUHPE","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"},"canonical_sha256":"90ac1a1de46533f2fcffc846e0eadca1b1dab6db7d3b76f97cfb182a070fae80","source":{"kind":"arxiv","id":"2411.16904","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16904","created_at":"2026-07-05T11:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16904v1","created_at":"2026-07-05T11:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16904","created_at":"2026-07-05T11:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"SCWBUHPEMUZ7","created_at":"2026-07-05T11:16:52Z"},{"alias_kind":"pith_short_16","alias_value":"SCWBUHPEMUZ7F7H7","created_at":"2026-07-05T11:16:52Z"},{"alias_kind":"pith_short_8","alias_value":"SCWBUHPE","created_at":"2026-07-05T11:16:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SCWBUHPEMUZ7F7H7ZBDOB2W4UG","target":"record","payload":{"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"},"canonical_sha256":"90ac1a1de46533f2fcffc846e0eadca1b1dab6db7d3b76f97cfb182a070fae80","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"},"source_kind":"arxiv","source_id":"2411.16904","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBjmE1nmkHIk7hMXqubB4YVNViaU8lKADZj/4wiPYhCNK4J9Jm7QhYTruPBNk8hOhNYAwUTRHmpxnsaEbMMrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:04:19.375734Z"},"content_sha256":"fab092eb24f6b3d7cd0a1d3bc922a82384b1673cca6f9d4e560ad81285325418","schema_version":"1.0","event_id":"sha256:fab092eb24f6b3d7cd0a1d3bc922a82384b1673cca6f9d4e560ad81285325418"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SCWBUHPEMUZ7F7H7ZBDOB2W4UG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ncqZrtyJwTq4TYiUQ7Ci2oSa1Y9IJgjNU5aOY6znc0xAJj0xMK3f0cuovqAn0W8e2g0QrQfFmIM4YgibR9sAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:04:19.376234Z"},"content_sha256":"32121d9dd74e9f88fbf0274f97ce7c4d37024992eab692fd7291ebddbbeda402","schema_version":"1.0","event_id":"sha256:32121d9dd74e9f88fbf0274f97ce7c4d37024992eab692fd7291ebddbbeda402"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/bundle.json","state_url":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T04:04:19Z","links":{"resolver":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG","bundle":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/bundle.json","state":"https://pith.science/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCWBUHPEMUZ7F7H7ZBDOB2W4UG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SCWBUHPEMUZ7F7H7ZBDOB2W4UG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ea19399baf33b36449f280db409b19fe5e0fb100db1a0fc154844443009921d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T20:15:27Z","title_canon_sha256":"62483dfade4cb29cb108650d854a7c43f22b7a56176601166ddd343d6f27a6ed"},"schema_version":"1.0","source":{"id":"2411.16904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16904","created_at":"2026-07-05T11:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16904v1","created_at":"2026-07-05T11:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16904","created_at":"2026-07-05T11:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"SCWBUHPEMUZ7","created_at":"2026-07-05T11:16:52Z"},{"alias_kind":"pith_short_16","alias_value":"SCWBUHPEMUZ7F7H7","created_at":"2026-07-05T11:16:52Z"},{"alias_kind":"pith_short_8","alias_value":"SCWBUHPE","created_at":"2026-07-05T11:16:52Z"}],"graph_snapshots":[{"event_id":"sha256:32121d9dd74e9f88fbf0274f97ce7c4d37024992eab692fd7291ebddbbeda402","target":"graph","created_at":"2026-07-05T11:16:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.16904/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ivan Damnjanovi\\'c, Nino Ba\\v{s}i\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T20:15:27Z","title":"On cubic polycirculant nut graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16904","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fab092eb24f6b3d7cd0a1d3bc922a82384b1673cca6f9d4e560ad81285325418","target":"record","created_at":"2026-07-05T11:16:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ea19399baf33b36449f280db409b19fe5e0fb100db1a0fc154844443009921d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T20:15:27Z","title_canon_sha256":"62483dfade4cb29cb108650d854a7c43f22b7a56176601166ddd343d6f27a6ed"},"schema_version":"1.0","source":{"id":"2411.16904","kind":"arxiv","version":1}},"canonical_sha256":"90ac1a1de46533f2fcffc846e0eadca1b1dab6db7d3b76f97cfb182a070fae80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90ac1a1de46533f2fcffc846e0eadca1b1dab6db7d3b76f97cfb182a070fae80","first_computed_at":"2026-07-05T11:16:52.796894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:52.796894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BNZE+UHswiV03yA6Z8NEhX/esfC5lpaj4qNtmrltbNYq4yRZjp9+vbyF8KvlAb9QCiOGLeMmm+hJhzqMnLdeCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:52.797404Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.16904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fab092eb24f6b3d7cd0a1d3bc922a82384b1673cca6f9d4e560ad81285325418","sha256:32121d9dd74e9f88fbf0274f97ce7c4d37024992eab692fd7291ebddbbeda402"],"state_sha256":"dd5b12428fce95da567b8b74ead75a18c4ee5b510aa72ee285b448246a8dad05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VLQddqnKve/e81WMOpW6mZrUxTO8eHmTqJxSH0k6ZFv7UezxGa27ILO3CzMnfiSIyBENlZKAoZm3MSYiogVhCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T04:04:19.379741Z","bundle_sha256":"7e280e340fee6be2391aa821314ef5b1a532aa8ee8e64547f8bb2348310a93f0"}}