{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O2NL2H2MGBSTLIZZWDKCYBFIFB","short_pith_number":"pith:O2NL2H2M","canonical_record":{"source":{"id":"1611.01474","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-04T18:08:53Z","cross_cats_sorted":[],"title_canon_sha256":"f0347aa04511f21fd7ff3251c8033c3a7b5465b6fa4dc86b6a075ee137ff85ca","abstract_canon_sha256":"68c74b76f8f22ae73ccfa5d5888f1cc87eab1402277a39a183d09f90239f230e"},"schema_version":"1.0"},"canonical_sha256":"769abd1f4c306535a339b0d42c04a828716805207d71e1d1c88f27bdfb1239d4","source":{"kind":"arxiv","id":"1611.01474","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01474","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01474v2","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01474","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"O2NL2H2MGBST","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O2NL2H2MGBSTLIZZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O2NL2H2M","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O2NL2H2MGBSTLIZZWDKCYBFIFB","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01474","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-04T18:08:53Z","cross_cats_sorted":[],"title_canon_sha256":"f0347aa04511f21fd7ff3251c8033c3a7b5465b6fa4dc86b6a075ee137ff85ca","abstract_canon_sha256":"68c74b76f8f22ae73ccfa5d5888f1cc87eab1402277a39a183d09f90239f230e"},"schema_version":"1.0"},"canonical_sha256":"769abd1f4c306535a339b0d42c04a828716805207d71e1d1c88f27bdfb1239d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:46.826238Z","signature_b64":"/aGVtSBAh+vHtoidGGaZErMuyZZ/fP7+/msSgS3It8YG4h3Mz816D5y7jNKQO17OGCYUlnm9NHUwvmYWFyctCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"769abd1f4c306535a339b0d42c04a828716805207d71e1d1c88f27bdfb1239d4","last_reissued_at":"2026-05-18T00:18:46.825777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:46.825777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01474","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-18T00:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aH3wFlhMRVGufJfR+EyqJrTPgIOlbWlv/sH3u4pV1EFBZ1luPJewjdiLYwDG6kt3a42gxd1MPruOd/v/HluHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:46:47.798565Z"},"content_sha256":"ee1a2467d88f21982e4faa06f2f220e496dcf12b3f624896f22bafe46e91e4a1","schema_version":"1.0","event_id":"sha256:ee1a2467d88f21982e4faa06f2f220e496dcf12b3f624896f22bafe46e91e4a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O2NL2H2MGBSTLIZZWDKCYBFIFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting independent sets in cubic graphs of given girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillem Perarnau, Will Perkins","submitted_at":"2016-11-04T18:08:53Z","abstract_excerpt":"We prove a tight upper bound on the independence polynomial (and total number of independent sets) of cubic graphs of girth at least 5. The bound is achieved by unions of the Heawood graph, the point/line incidence graph of the Fano plane.\n  We also give a tight lower bound on the total number of independent sets of triangle-free cubic graphs. This bound is achieved by unions of the Petersen graph.\n  We conjecture that in fact all Moore graphs are extremal for the scaled number of independent sets in regular graphs of a given minimum girth, maximizing this quantity if their girth is even and m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01474","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-18T00:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z9YxPPYNR44mQqwaLDJ4I4Lt5n8stJsI7JMXEtyveEkEeqSld7lFanV/RgD5UF0iKwzLgwY5Sih9Yn2P2IJzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:46:47.799173Z"},"content_sha256":"198c5f5873871608dc343183492ebbe199afc1f12522ca0f5e420a11ee5c5f20","schema_version":"1.0","event_id":"sha256:198c5f5873871608dc343183492ebbe199afc1f12522ca0f5e420a11ee5c5f20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2NL2H2MGBSTLIZZWDKCYBFIFB/bundle.json","state_url":"https://pith.science/pith/O2NL2H2MGBSTLIZZWDKCYBFIFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2NL2H2MGBSTLIZZWDKCYBFIFB/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-06-06T18:46:47Z","links":{"resolver":"https://pith.science/pith/O2NL2H2MGBSTLIZZWDKCYBFIFB","bundle":"https://pith.science/pith/O2NL2H2MGBSTLIZZWDKCYBFIFB/bundle.json","state":"https://pith.science/pith/O2NL2H2MGBSTLIZZWDKCYBFIFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2NL2H2MGBSTLIZZWDKCYBFIFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O2NL2H2MGBSTLIZZWDKCYBFIFB","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":"68c74b76f8f22ae73ccfa5d5888f1cc87eab1402277a39a183d09f90239f230e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-04T18:08:53Z","title_canon_sha256":"f0347aa04511f21fd7ff3251c8033c3a7b5465b6fa4dc86b6a075ee137ff85ca"},"schema_version":"1.0","source":{"id":"1611.01474","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01474","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01474v2","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01474","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"O2NL2H2MGBST","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O2NL2H2MGBSTLIZZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O2NL2H2M","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:198c5f5873871608dc343183492ebbe199afc1f12522ca0f5e420a11ee5c5f20","target":"graph","created_at":"2026-05-18T00:18: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":"We prove a tight upper bound on the independence polynomial (and total number of independent sets) of cubic graphs of girth at least 5. The bound is achieved by unions of the Heawood graph, the point/line incidence graph of the Fano plane.\n  We also give a tight lower bound on the total number of independent sets of triangle-free cubic graphs. This bound is achieved by unions of the Petersen graph.\n  We conjecture that in fact all Moore graphs are extremal for the scaled number of independent sets in regular graphs of a given minimum girth, maximizing this quantity if their girth is even and m","authors_text":"Guillem Perarnau, Will Perkins","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-04T18:08:53Z","title":"Counting independent sets in cubic graphs of given girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01474","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:ee1a2467d88f21982e4faa06f2f220e496dcf12b3f624896f22bafe46e91e4a1","target":"record","created_at":"2026-05-18T00:18: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":"68c74b76f8f22ae73ccfa5d5888f1cc87eab1402277a39a183d09f90239f230e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-04T18:08:53Z","title_canon_sha256":"f0347aa04511f21fd7ff3251c8033c3a7b5465b6fa4dc86b6a075ee137ff85ca"},"schema_version":"1.0","source":{"id":"1611.01474","kind":"arxiv","version":2}},"canonical_sha256":"769abd1f4c306535a339b0d42c04a828716805207d71e1d1c88f27bdfb1239d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"769abd1f4c306535a339b0d42c04a828716805207d71e1d1c88f27bdfb1239d4","first_computed_at":"2026-05-18T00:18:46.825777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:46.825777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/aGVtSBAh+vHtoidGGaZErMuyZZ/fP7+/msSgS3It8YG4h3Mz816D5y7jNKQO17OGCYUlnm9NHUwvmYWFyctCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:46.826238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01474","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee1a2467d88f21982e4faa06f2f220e496dcf12b3f624896f22bafe46e91e4a1","sha256:198c5f5873871608dc343183492ebbe199afc1f12522ca0f5e420a11ee5c5f20"],"state_sha256":"58710e55e68eea81458e5627ccfa3d37da8d196604cb789383ee14c5824c70a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77yDckBSl6jA16ATA7FfXbfLkp9alJHaobLZ+DDt5VMSMbwaE8tJAN0fHQQSmB/PHjs4IRUrScOH3ZUZG+5EAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:46:47.802468Z","bundle_sha256":"7832d78dce5d20b2b022ce2c08fd452352d1353364b9685ed96bb9cfe5ea9847"}}