{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:23XI7CFCMLBUYGQK5FY5ZRFESN","short_pith_number":"pith:23XI7CFC","canonical_record":{"source":{"id":"math/0701647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-01-23T15:37:47Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"c76eaf46130b5af8b086092496918318b1114ccc7b34eb70f6f9c968f00266f7","abstract_canon_sha256":"eb84ce95b834c365216bedc0944b5c318ef14652dc40df0eda800d52abf42da1"},"schema_version":"1.0"},"canonical_sha256":"d6ee8f88a262c34c1a0ae971dcc4a49363053eaeb80ca3c4b912bf1ae4215427","source":{"kind":"arxiv","id":"math/0701647","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0701647","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"math/0701647v2","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0701647","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"23XI7CFCMLBU","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"23XI7CFCMLBUYGQK","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"23XI7CFC","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:23XI7CFCMLBUYGQK5FY5ZRFESN","target":"record","payload":{"canonical_record":{"source":{"id":"math/0701647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-01-23T15:37:47Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"c76eaf46130b5af8b086092496918318b1114ccc7b34eb70f6f9c968f00266f7","abstract_canon_sha256":"eb84ce95b834c365216bedc0944b5c318ef14652dc40df0eda800d52abf42da1"},"schema_version":"1.0"},"canonical_sha256":"d6ee8f88a262c34c1a0ae971dcc4a49363053eaeb80ca3c4b912bf1ae4215427","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:46.440053Z","signature_b64":"EyTBi+8PnMqJPjaLuBoT1Gsm5AZzAhLeoIum+H6hmgiMyayPGtOuh134jDdPS5Z6ThEiGPYefjWyg2dj5Eh0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6ee8f88a262c34c1a0ae971dcc4a49363053eaeb80ca3c4b912bf1ae4215427","last_reissued_at":"2026-05-18T04:35:46.439396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:46.439396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0701647","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-05-18T04:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkX3UNrpcZVn80haLn2FMz/sYUyRPWOejsmGMQeHivVMjTYTxD8c0N5DSAt07AwOeHO2vrYLmtJUFg0qHsTXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:35:02.374077Z"},"content_sha256":"91a7dd0157502c9a361e65db31ff73337040262465e94ac4228c86736f802e3f","schema_version":"1.0","event_id":"sha256:91a7dd0157502c9a361e65db31ff73337040262465e94ac4228c86736f802e3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:23XI7CFCMLBUYGQK5FY5ZRFESN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting non-isomorphic maximal independent sets of the n-cycle graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.GR"],"primary_cat":"math.CO","authors_text":"Jean-Luc Marichal, Raymond Bisdorff","submitted_at":"2007-01-23T15:37:47Z","abstract_excerpt":"The number of maximal independent sets of the n-cycle graph C_n is known to be the nth term of the Perrin sequence. The action of the automorphism group of C_n on the family of these maximal independent sets partitions this family into disjoint orbits, which represent the non-isomorphic (i.e., defined up to a rotation and a reflection) maximal independent sets. We provide exact formulas for the total number of orbits and the number of orbits having a given number of isomorphic representatives. We also provide exact formulas for the total number of unlabeled (i.e., defined up to a rotation) max"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0701647","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":""},"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-18T04:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D4GdFxy/ejMSLJAHF19FzGPkEaMVZmeA6AHtL7bjoZ+qDRFNM9oVnLS0+wOtE8/Xk4Jy5EvUxR6x9Sk7q5H6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:35:02.374497Z"},"content_sha256":"87d420b9e0c4cb2bce45378aee5069e20ad2c5b6022ce9e76f3e08b1a666f105","schema_version":"1.0","event_id":"sha256:87d420b9e0c4cb2bce45378aee5069e20ad2c5b6022ce9e76f3e08b1a666f105"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/23XI7CFCMLBUYGQK5FY5ZRFESN/bundle.json","state_url":"https://pith.science/pith/23XI7CFCMLBUYGQK5FY5ZRFESN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/23XI7CFCMLBUYGQK5FY5ZRFESN/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-27T05:35:02Z","links":{"resolver":"https://pith.science/pith/23XI7CFCMLBUYGQK5FY5ZRFESN","bundle":"https://pith.science/pith/23XI7CFCMLBUYGQK5FY5ZRFESN/bundle.json","state":"https://pith.science/pith/23XI7CFCMLBUYGQK5FY5ZRFESN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/23XI7CFCMLBUYGQK5FY5ZRFESN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:23XI7CFCMLBUYGQK5FY5ZRFESN","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":"eb84ce95b834c365216bedc0944b5c318ef14652dc40df0eda800d52abf42da1","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-01-23T15:37:47Z","title_canon_sha256":"c76eaf46130b5af8b086092496918318b1114ccc7b34eb70f6f9c968f00266f7"},"schema_version":"1.0","source":{"id":"math/0701647","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0701647","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"math/0701647v2","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0701647","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"23XI7CFCMLBU","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"23XI7CFCMLBUYGQK","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"23XI7CFC","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:87d420b9e0c4cb2bce45378aee5069e20ad2c5b6022ce9e76f3e08b1a666f105","target":"graph","created_at":"2026-05-18T04:35:46Z","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":"The number of maximal independent sets of the n-cycle graph C_n is known to be the nth term of the Perrin sequence. The action of the automorphism group of C_n on the family of these maximal independent sets partitions this family into disjoint orbits, which represent the non-isomorphic (i.e., defined up to a rotation and a reflection) maximal independent sets. We provide exact formulas for the total number of orbits and the number of orbits having a given number of isomorphic representatives. We also provide exact formulas for the total number of unlabeled (i.e., defined up to a rotation) max","authors_text":"Jean-Luc Marichal, Raymond Bisdorff","cross_cats":["cs.DM","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-01-23T15:37:47Z","title":"Counting non-isomorphic maximal independent sets of the n-cycle graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0701647","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:91a7dd0157502c9a361e65db31ff73337040262465e94ac4228c86736f802e3f","target":"record","created_at":"2026-05-18T04:35:46Z","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":"eb84ce95b834c365216bedc0944b5c318ef14652dc40df0eda800d52abf42da1","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-01-23T15:37:47Z","title_canon_sha256":"c76eaf46130b5af8b086092496918318b1114ccc7b34eb70f6f9c968f00266f7"},"schema_version":"1.0","source":{"id":"math/0701647","kind":"arxiv","version":2}},"canonical_sha256":"d6ee8f88a262c34c1a0ae971dcc4a49363053eaeb80ca3c4b912bf1ae4215427","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6ee8f88a262c34c1a0ae971dcc4a49363053eaeb80ca3c4b912bf1ae4215427","first_computed_at":"2026-05-18T04:35:46.439396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:46.439396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EyTBi+8PnMqJPjaLuBoT1Gsm5AZzAhLeoIum+H6hmgiMyayPGtOuh134jDdPS5Z6ThEiGPYefjWyg2dj5Eh0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:46.440053Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0701647","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91a7dd0157502c9a361e65db31ff73337040262465e94ac4228c86736f802e3f","sha256:87d420b9e0c4cb2bce45378aee5069e20ad2c5b6022ce9e76f3e08b1a666f105"],"state_sha256":"7f9f17350c5ae7d9956298bd23d12898be197488266906015ad129daacb4d328"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1G7CigxoS2oDJH831wVY9KujImo4G6MSw+nSDkuF/xxATGjfSdRZFB4mBMx98adBIDpRy1LotU4IH0aTjn+8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:35:02.376945Z","bundle_sha256":"e4b7e5b2df7c4b2911edfba7ecc6c7402999495d092d86e3cfc4c2fabb3166af"}}