{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S7FCNYREOQKER2SQMFOCE2HP7I","short_pith_number":"pith:S7FCNYRE","canonical_record":{"source":{"id":"1709.04254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T11:11:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9e71e5b76da0de50fa8ca8abe162b696169c2b67f213503bcb116dc15cf080d7","abstract_canon_sha256":"e7649bc0ed729fdc89015630b2791afc4391bcc0e62051698ac00a6dc9316113"},"schema_version":"1.0"},"canonical_sha256":"97ca26e224741448ea50615c2268effa0f2efffbac92deb495b2d7e9c685aca9","source":{"kind":"arxiv","id":"1709.04254","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04254","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04254v1","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04254","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"S7FCNYREOQKE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S7FCNYREOQKER2SQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S7FCNYRE","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S7FCNYREOQKER2SQMFOCE2HP7I","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T11:11:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9e71e5b76da0de50fa8ca8abe162b696169c2b67f213503bcb116dc15cf080d7","abstract_canon_sha256":"e7649bc0ed729fdc89015630b2791afc4391bcc0e62051698ac00a6dc9316113"},"schema_version":"1.0"},"canonical_sha256":"97ca26e224741448ea50615c2268effa0f2efffbac92deb495b2d7e9c685aca9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:14.883498Z","signature_b64":"OYo27prGejqhgF6rokOuvzu76IB57wDrHXxdFW6oX+I7KCwITeoGrIRSPCIqar/FBNW948MGBFaxUChszJ/pBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97ca26e224741448ea50615c2268effa0f2efffbac92deb495b2d7e9c685aca9","last_reissued_at":"2026-05-18T00:35:14.882924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:14.882924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04254","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-05-18T00:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dyxGPVQYmZhZiOVfP+tYiqZarLuSQ0YHVVyple/SFaQ61+rd1Wlq7mntb9/+jeLCsndPDuHm4gwyaMImSef3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:29:05.979947Z"},"content_sha256":"d038d7d0ae75fa136594c34a3975dbb24c2e60c575cfef555bb8ed7c04be48df","schema_version":"1.0","event_id":"sha256:d038d7d0ae75fa136594c34a3975dbb24c2e60c575cfef555bb8ed7c04be48df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S7FCNYREOQKER2SQMFOCE2HP7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generation and properties of nut graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Goedgebeur, Kris Coolsaet, Patrick W. Fowler","submitted_at":"2017-09-13T11:11:07Z","abstract_excerpt":"A nut graph is a graph on at least 2 vertices whose adjacency matrix has nullity 1 and for which non-trivial kernel vectors do not contain a zero. Chemical graphs are connected, with maximum degree at most three. We present a new algorithm for the exhaustive generation of non-isomorphic nut graphs. Using this algorithm, we determined all nut graphs up to 13 vertices and all chemical nut graphs up to 22 vertices. Furthermore, we determined all nut graphs among the cubic polyhedra up to 34 vertices and all nut fullerenes up to 250 vertices.\n  Nut graphs are of interest in chemistry of conjugated"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04254","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":""},"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-05-18T00:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xs4+nsdiA7hO80uaTAOiHdxpVCf+miH8BHvdBRQIYEqOzLYfyDUNC6nMekevENyHvB3I/fKsVKvdz2Je6Ns3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:29:05.980654Z"},"content_sha256":"c339f9e55515f27af6fe8897754a880e77188d16d163e4e60bfcef098473ffaa","schema_version":"1.0","event_id":"sha256:c339f9e55515f27af6fe8897754a880e77188d16d163e4e60bfcef098473ffaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7FCNYREOQKER2SQMFOCE2HP7I/bundle.json","state_url":"https://pith.science/pith/S7FCNYREOQKER2SQMFOCE2HP7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7FCNYREOQKER2SQMFOCE2HP7I/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-05-31T15:29:05Z","links":{"resolver":"https://pith.science/pith/S7FCNYREOQKER2SQMFOCE2HP7I","bundle":"https://pith.science/pith/S7FCNYREOQKER2SQMFOCE2HP7I/bundle.json","state":"https://pith.science/pith/S7FCNYREOQKER2SQMFOCE2HP7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7FCNYREOQKER2SQMFOCE2HP7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S7FCNYREOQKER2SQMFOCE2HP7I","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":"e7649bc0ed729fdc89015630b2791afc4391bcc0e62051698ac00a6dc9316113","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T11:11:07Z","title_canon_sha256":"9e71e5b76da0de50fa8ca8abe162b696169c2b67f213503bcb116dc15cf080d7"},"schema_version":"1.0","source":{"id":"1709.04254","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04254","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04254v1","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04254","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"S7FCNYREOQKE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S7FCNYREOQKER2SQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S7FCNYRE","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:c339f9e55515f27af6fe8897754a880e77188d16d163e4e60bfcef098473ffaa","target":"graph","created_at":"2026-05-18T00:35:14Z","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"},"paper":{"abstract_excerpt":"A nut graph is a graph on at least 2 vertices whose adjacency matrix has nullity 1 and for which non-trivial kernel vectors do not contain a zero. Chemical graphs are connected, with maximum degree at most three. We present a new algorithm for the exhaustive generation of non-isomorphic nut graphs. Using this algorithm, we determined all nut graphs up to 13 vertices and all chemical nut graphs up to 22 vertices. Furthermore, we determined all nut graphs among the cubic polyhedra up to 34 vertices and all nut fullerenes up to 250 vertices.\n  Nut graphs are of interest in chemistry of conjugated","authors_text":"Jan Goedgebeur, Kris Coolsaet, Patrick W. Fowler","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T11:11:07Z","title":"Generation and properties of nut graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04254","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:d038d7d0ae75fa136594c34a3975dbb24c2e60c575cfef555bb8ed7c04be48df","target":"record","created_at":"2026-05-18T00:35:14Z","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":"e7649bc0ed729fdc89015630b2791afc4391bcc0e62051698ac00a6dc9316113","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T11:11:07Z","title_canon_sha256":"9e71e5b76da0de50fa8ca8abe162b696169c2b67f213503bcb116dc15cf080d7"},"schema_version":"1.0","source":{"id":"1709.04254","kind":"arxiv","version":1}},"canonical_sha256":"97ca26e224741448ea50615c2268effa0f2efffbac92deb495b2d7e9c685aca9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97ca26e224741448ea50615c2268effa0f2efffbac92deb495b2d7e9c685aca9","first_computed_at":"2026-05-18T00:35:14.882924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:14.882924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OYo27prGejqhgF6rokOuvzu76IB57wDrHXxdFW6oX+I7KCwITeoGrIRSPCIqar/FBNW948MGBFaxUChszJ/pBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:14.883498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04254","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d038d7d0ae75fa136594c34a3975dbb24c2e60c575cfef555bb8ed7c04be48df","sha256:c339f9e55515f27af6fe8897754a880e77188d16d163e4e60bfcef098473ffaa"],"state_sha256":"98824fa46b9da437aed8c9cf197e562ded6e263a332db4e97564d0716eb46ccd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jYFijdZLqQqOYyAzGhUQzJmXKuHZZ65mvoI6zFUtjolYqazk7UVfSk0KNZOYy9yTHhcW/wIwRhP0XEpb5YvmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:29:05.985122Z","bundle_sha256":"856cddb3570d1e6a07004dcd0e30aaef34c7ec30394eb3b37a3c4576fc2db20c"}}