{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FVWDZ3JQRBMSXJTFE47BBG25TN","short_pith_number":"pith:FVWDZ3JQ","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"},"canonical_sha256":"2d6c3ced3088592ba665273e109b5d9b4776b2eafa6f5abbd76b9da73688ef97","source":{"kind":"arxiv","id":"2410.14063","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.14063","created_at":"2026-07-05T11:15:39Z"},{"alias_kind":"arxiv_version","alias_value":"2410.14063v2","created_at":"2026-07-05T11:15:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14063","created_at":"2026-07-05T11:15:39Z"},{"alias_kind":"pith_short_12","alias_value":"FVWDZ3JQRBMS","created_at":"2026-07-05T11:15:39Z"},{"alias_kind":"pith_short_16","alias_value":"FVWDZ3JQRBMSXJTF","created_at":"2026-07-05T11:15:39Z"},{"alias_kind":"pith_short_8","alias_value":"FVWDZ3JQ","created_at":"2026-07-05T11:15:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FVWDZ3JQRBMSXJTFE47BBG25TN","target":"record","payload":{"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"},"canonical_sha256":"2d6c3ced3088592ba665273e109b5d9b4776b2eafa6f5abbd76b9da73688ef97","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"},"source_kind":"arxiv","source_id":"2410.14063","source_version":2,"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:15:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7hKuOW/mNXdjsh9YzLvPGcMjKAa3mXfUigsiw/hz0ZWp4T3YJVaN+rUVVp/KlNyiIx1qptPxqfZxZURGfT8HDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T09:49:23.529234Z"},"content_sha256":"9f8f753bdc0bec1ee9a764cdf31bccd291d579f2b87e80144790553f26b55c2a","schema_version":"1.0","event_id":"sha256:9f8f753bdc0bec1ee9a764cdf31bccd291d579f2b87e80144790553f26b55c2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FVWDZ3JQRBMSXJTFE47BBG25TN","target":"graph","payload":{"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"},"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:15:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CE01BJOzwpGSJ23BVWnj/WSuxbAplbSCjZqM4q24MeoTx4gn29TlTzOJplvSZboOWh2kImYV7ZTPR/BX7eFJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T09:49:23.529744Z"},"content_sha256":"90656547e1b493513fa7d256fdfb7314591c382cc5948484c40ed016a7c0449e","schema_version":"1.0","event_id":"sha256:90656547e1b493513fa7d256fdfb7314591c382cc5948484c40ed016a7c0449e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN/bundle.json","state_url":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVWDZ3JQRBMSXJTFE47BBG25TN/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-13T09:49:23Z","links":{"resolver":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN","bundle":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN/bundle.json","state":"https://pith.science/pith/FVWDZ3JQRBMSXJTFE47BBG25TN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVWDZ3JQRBMSXJTFE47BBG25TN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FVWDZ3JQRBMSXJTFE47BBG25TN","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":"b23c69971e371584e2269b311d167cc64f1707a2218873b7d44b33cb3ab8499b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-17T22:16:27Z","title_canon_sha256":"26a46e876e5ac5396d225438ee12a3cc5831eeb907db928e2f93eb2cffe25fba"},"schema_version":"1.0","source":{"id":"2410.14063","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.14063","created_at":"2026-07-05T11:15:39Z"},{"alias_kind":"arxiv_version","alias_value":"2410.14063v2","created_at":"2026-07-05T11:15:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14063","created_at":"2026-07-05T11:15:39Z"},{"alias_kind":"pith_short_12","alias_value":"FVWDZ3JQRBMS","created_at":"2026-07-05T11:15:39Z"},{"alias_kind":"pith_short_16","alias_value":"FVWDZ3JQRBMSXJTF","created_at":"2026-07-05T11:15:39Z"},{"alias_kind":"pith_short_8","alias_value":"FVWDZ3JQ","created_at":"2026-07-05T11:15:39Z"}],"graph_snapshots":[{"event_id":"sha256:90656547e1b493513fa7d256fdfb7314591c382cc5948484c40ed016a7c0449e","target":"graph","created_at":"2026-07-05T11:15:39Z","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/2410.14063/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Ivan Damnjanovi\\'c, Nino Ba\\v{s}i\\'c, Patrick W. Fowler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-17T22:16:27Z","title":"On the degrees of regular nut graphs and Cayley nut graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.14063","kind":"arxiv","version":2},"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:9f8f753bdc0bec1ee9a764cdf31bccd291d579f2b87e80144790553f26b55c2a","target":"record","created_at":"2026-07-05T11:15:39Z","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":"b23c69971e371584e2269b311d167cc64f1707a2218873b7d44b33cb3ab8499b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-17T22:16:27Z","title_canon_sha256":"26a46e876e5ac5396d225438ee12a3cc5831eeb907db928e2f93eb2cffe25fba"},"schema_version":"1.0","source":{"id":"2410.14063","kind":"arxiv","version":2}},"canonical_sha256":"2d6c3ced3088592ba665273e109b5d9b4776b2eafa6f5abbd76b9da73688ef97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d6c3ced3088592ba665273e109b5d9b4776b2eafa6f5abbd76b9da73688ef97","first_computed_at":"2026-07-05T11:15:39.918818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:39.918818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c7NUt1JpwKRAfqP06AJqNe+ZiZrUpBLoRagmGUnC/u0rJC3GhA1bSB896bnUScmuJnPCumpgPkAs9p/xIgIjBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:39.919231Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.14063","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f8f753bdc0bec1ee9a764cdf31bccd291d579f2b87e80144790553f26b55c2a","sha256:90656547e1b493513fa7d256fdfb7314591c382cc5948484c40ed016a7c0449e"],"state_sha256":"210a613a1eef696a16dca2eb0a7aa746653354826ae16c9c3a0decf13970c93c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cIZbzJtcSN979CitSGKcy6pk2xeSadzMENRxfgJfu87RmVfRL7lc6s88YoaMiux8C5TW+L9ok+Pq8F3tlGklCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T09:49:23.534055Z","bundle_sha256":"649145fc7c575d5feb43a6fdc05ec6f4c9e8a0d2e7f9c761029c0c4257745267"}}