{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FX7CWTZWGZNGVDDEOPFARNT2VE","short_pith_number":"pith:FX7CWTZW","canonical_record":{"source":{"id":"2502.06353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-10T11:08:02Z","cross_cats_sorted":[],"title_canon_sha256":"a3ceb30cd40a00b970194c5a22c9ab97400a6098fbc5e52f1df2fc96fa933e4a","abstract_canon_sha256":"efc520b7bd947ac73f8dfb5556d7021f78592c07d0828573d87adba12b7d58aa"},"schema_version":"1.0"},"canonical_sha256":"2dfe2b4f36365a6a8c6473ca08b67aa92ae96a8c164620a87c082d28edd302d2","source":{"kind":"arxiv","id":"2502.06353","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.06353","created_at":"2026-07-05T10:12:05Z"},{"alias_kind":"arxiv_version","alias_value":"2502.06353v1","created_at":"2026-07-05T10:12:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06353","created_at":"2026-07-05T10:12:05Z"},{"alias_kind":"pith_short_12","alias_value":"FX7CWTZWGZNG","created_at":"2026-07-05T10:12:05Z"},{"alias_kind":"pith_short_16","alias_value":"FX7CWTZWGZNGVDDE","created_at":"2026-07-05T10:12:05Z"},{"alias_kind":"pith_short_8","alias_value":"FX7CWTZW","created_at":"2026-07-05T10:12:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FX7CWTZWGZNGVDDEOPFARNT2VE","target":"record","payload":{"canonical_record":{"source":{"id":"2502.06353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-10T11:08:02Z","cross_cats_sorted":[],"title_canon_sha256":"a3ceb30cd40a00b970194c5a22c9ab97400a6098fbc5e52f1df2fc96fa933e4a","abstract_canon_sha256":"efc520b7bd947ac73f8dfb5556d7021f78592c07d0828573d87adba12b7d58aa"},"schema_version":"1.0"},"canonical_sha256":"2dfe2b4f36365a6a8c6473ca08b67aa92ae96a8c164620a87c082d28edd302d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:05.535489Z","signature_b64":"DKw2kuy0nsqJD45YlLErbf4mjR9bONL2ARLfq4e7GdBrIWLU/R65t1PbAs+QJIg5NKx59HkwEBy+CYl8gwblAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dfe2b4f36365a6a8c6473ca08b67aa92ae96a8c164620a87c082d28edd302d2","last_reissued_at":"2026-07-05T10:12:05.534971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:05.534971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.06353","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-05T10:12:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDIhf5Xl1/tM/L9OlSx3+Zu6J79MXPoPRPQ16A1fW/OD8rSRGCIwG6q2zAeV88qT3Qop4S8n0XWjKTtDaIUUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:08:34.169458Z"},"content_sha256":"e0b4d9f04a2ce7829eaf778642edda31f1926f8b02c2de403e473e6f76be8486","schema_version":"1.0","event_id":"sha256:e0b4d9f04a2ce7829eaf778642edda31f1926f8b02c2de403e473e6f76be8486"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FX7CWTZWGZNGVDDEOPFARNT2VE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classification of quartic bicirculant nut graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arjana \\v{Z}itnik, Ivan Damnjanovi\\'c, Nino Ba\\v{s}i\\'c, Toma\\v{z} Pisanski","submitted_at":"2025-02-10T11:08:02Z","abstract_excerpt":"A graph is called a nut graph if zero is its eigenvalue of multiplicity one and its corresponding eigenvector has no zero entries. A graph is a bicirculant if it admits an automorphism with two equally sized vertex orbits. There are four classes of connected quartic bicirculant graphs. We classify the quartic bicirculant graphs that are nut graphs by investigating properties of each of these four classes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06353","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/2502.06353/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-05T10:12:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IghL/Lz4vSzmaeeAxDcec7WvneQh4MGDo5ANuW+cDRRzl7h80dhFg6nS4S48Vnt9Srr9WlivyJa8EDTrPCo+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:08:34.170351Z"},"content_sha256":"6f545703c21a6bdfc5ca9545e33315190b0ab080d580fd146b516c9b58165607","schema_version":"1.0","event_id":"sha256:6f545703c21a6bdfc5ca9545e33315190b0ab080d580fd146b516c9b58165607"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FX7CWTZWGZNGVDDEOPFARNT2VE/bundle.json","state_url":"https://pith.science/pith/FX7CWTZWGZNGVDDEOPFARNT2VE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FX7CWTZWGZNGVDDEOPFARNT2VE/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-13T05:08:34Z","links":{"resolver":"https://pith.science/pith/FX7CWTZWGZNGVDDEOPFARNT2VE","bundle":"https://pith.science/pith/FX7CWTZWGZNGVDDEOPFARNT2VE/bundle.json","state":"https://pith.science/pith/FX7CWTZWGZNGVDDEOPFARNT2VE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FX7CWTZWGZNGVDDEOPFARNT2VE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FX7CWTZWGZNGVDDEOPFARNT2VE","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":"efc520b7bd947ac73f8dfb5556d7021f78592c07d0828573d87adba12b7d58aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-10T11:08:02Z","title_canon_sha256":"a3ceb30cd40a00b970194c5a22c9ab97400a6098fbc5e52f1df2fc96fa933e4a"},"schema_version":"1.0","source":{"id":"2502.06353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.06353","created_at":"2026-07-05T10:12:05Z"},{"alias_kind":"arxiv_version","alias_value":"2502.06353v1","created_at":"2026-07-05T10:12:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06353","created_at":"2026-07-05T10:12:05Z"},{"alias_kind":"pith_short_12","alias_value":"FX7CWTZWGZNG","created_at":"2026-07-05T10:12:05Z"},{"alias_kind":"pith_short_16","alias_value":"FX7CWTZWGZNGVDDE","created_at":"2026-07-05T10:12:05Z"},{"alias_kind":"pith_short_8","alias_value":"FX7CWTZW","created_at":"2026-07-05T10:12:05Z"}],"graph_snapshots":[{"event_id":"sha256:6f545703c21a6bdfc5ca9545e33315190b0ab080d580fd146b516c9b58165607","target":"graph","created_at":"2026-07-05T10:12:05Z","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/2502.06353/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph is called a nut graph if zero is its eigenvalue of multiplicity one and its corresponding eigenvector has no zero entries. A graph is a bicirculant if it admits an automorphism with two equally sized vertex orbits. There are four classes of connected quartic bicirculant graphs. We classify the quartic bicirculant graphs that are nut graphs by investigating properties of each of these four classes.","authors_text":"Arjana \\v{Z}itnik, Ivan Damnjanovi\\'c, Nino Ba\\v{s}i\\'c, Toma\\v{z} Pisanski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-10T11:08:02Z","title":"Classification of quartic bicirculant nut graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06353","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:e0b4d9f04a2ce7829eaf778642edda31f1926f8b02c2de403e473e6f76be8486","target":"record","created_at":"2026-07-05T10:12:05Z","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":"efc520b7bd947ac73f8dfb5556d7021f78592c07d0828573d87adba12b7d58aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-10T11:08:02Z","title_canon_sha256":"a3ceb30cd40a00b970194c5a22c9ab97400a6098fbc5e52f1df2fc96fa933e4a"},"schema_version":"1.0","source":{"id":"2502.06353","kind":"arxiv","version":1}},"canonical_sha256":"2dfe2b4f36365a6a8c6473ca08b67aa92ae96a8c164620a87c082d28edd302d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dfe2b4f36365a6a8c6473ca08b67aa92ae96a8c164620a87c082d28edd302d2","first_computed_at":"2026-07-05T10:12:05.534971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:12:05.534971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DKw2kuy0nsqJD45YlLErbf4mjR9bONL2ARLfq4e7GdBrIWLU/R65t1PbAs+QJIg5NKx59HkwEBy+CYl8gwblAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:12:05.535489Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.06353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0b4d9f04a2ce7829eaf778642edda31f1926f8b02c2de403e473e6f76be8486","sha256:6f545703c21a6bdfc5ca9545e33315190b0ab080d580fd146b516c9b58165607"],"state_sha256":"16c0545b39b98184a59f6b513715651219de36ef88136ff856ee22caa1f4c980"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIGYt+4HkBDEuz982Qgbg5mw+psW05Xws6FoH7PImRIkjRuvxcJnRdAyOvX3OcI9c/IH7B1o2fZuNxb//8NcAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T05:08:34.175476Z","bundle_sha256":"3becf599e90cf4b335c94ab68eafd91a8c08d08cd80e6c15b27a60df63622c25"}}