{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5LELYMXU5GDH4J3JCWD6FAJOBD","short_pith_number":"pith:5LELYMXU","canonical_record":{"source":{"id":"1308.3242","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T20:12:48Z","cross_cats_sorted":[],"title_canon_sha256":"2dc0d9df2f6e5a47cbb2626673086a5aed83be990eae4e17014b70deb8236346","abstract_canon_sha256":"17ccd3ceb0f96ce1ab12b81a69ac2fd7ac3ee94c32f4afe1727e20ec7bc12adc"},"schema_version":"1.0"},"canonical_sha256":"eac8bc32f4e9867e27691587e2812e08ca0c054b6dbb208817786709aa460b1a","source":{"kind":"arxiv","id":"1308.3242","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3242","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3242v2","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3242","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"5LELYMXU5GDH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5LELYMXU5GDH4J3J","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5LELYMXU","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5LELYMXU5GDH4J3JCWD6FAJOBD","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3242","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T20:12:48Z","cross_cats_sorted":[],"title_canon_sha256":"2dc0d9df2f6e5a47cbb2626673086a5aed83be990eae4e17014b70deb8236346","abstract_canon_sha256":"17ccd3ceb0f96ce1ab12b81a69ac2fd7ac3ee94c32f4afe1727e20ec7bc12adc"},"schema_version":"1.0"},"canonical_sha256":"eac8bc32f4e9867e27691587e2812e08ca0c054b6dbb208817786709aa460b1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:32.546840Z","signature_b64":"jkAQUNCp7NrqQQon+4xGLAiWKbiP2emXaGJSDtwcTqAd8fepy60/bpNJ2x+y/rlYxFeGsYk0DnvX+MkX7FbjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eac8bc32f4e9867e27691587e2812e08ca0c054b6dbb208817786709aa460b1a","last_reissued_at":"2026-05-18T02:30:32.546344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:32.546344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3242","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-18T02:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QB0DbtbKAiu6mCv8AO3BA5Hib5r0OMOjXj7ICM/9UuzNq8iMeXbdnZmnKEcEoFDnWZ/Nx+rey54qK6/S0SCpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:00:39.670678Z"},"content_sha256":"9ae5aa2589218295b84845a20669cd2a99507062cf1f53186c91ab79ee19466f","schema_version":"1.0","event_id":"sha256:9ae5aa2589218295b84845a20669cd2a99507062cf1f53186c91ab79ee19466f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5LELYMXU5GDH4J3JCWD6FAJOBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new method for enumerating independent sets of a fixed size in general graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"James Alexander, Tim Mink","submitted_at":"2013-08-14T20:12:48Z","abstract_excerpt":"We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all but finitely many graphs. We also use our method to prove special cases of a conjecture of Kahn. In addition, we show that our method is particularly useful for computing the number of independent sets of small sizes in general regular graphs and Moore graphs, and we argue that it can be used in many other cases when dealing with graphs that have numerous structural restrictions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3242","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-18T02:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qyCp94r06lbZJvpTMWChX/iLzQRborFvzdrtEfIS91kiZbNWh/jEYaQopEcH1QP907Cj/enAkz3IB2UQJOhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:00:39.671386Z"},"content_sha256":"6f3e421a63fd817af68581fe14a2b883fafca494c9986fa72053709b22acbbb9","schema_version":"1.0","event_id":"sha256:6f3e421a63fd817af68581fe14a2b883fafca494c9986fa72053709b22acbbb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LELYMXU5GDH4J3JCWD6FAJOBD/bundle.json","state_url":"https://pith.science/pith/5LELYMXU5GDH4J3JCWD6FAJOBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LELYMXU5GDH4J3JCWD6FAJOBD/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-25T15:00:39Z","links":{"resolver":"https://pith.science/pith/5LELYMXU5GDH4J3JCWD6FAJOBD","bundle":"https://pith.science/pith/5LELYMXU5GDH4J3JCWD6FAJOBD/bundle.json","state":"https://pith.science/pith/5LELYMXU5GDH4J3JCWD6FAJOBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LELYMXU5GDH4J3JCWD6FAJOBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5LELYMXU5GDH4J3JCWD6FAJOBD","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":"17ccd3ceb0f96ce1ab12b81a69ac2fd7ac3ee94c32f4afe1727e20ec7bc12adc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T20:12:48Z","title_canon_sha256":"2dc0d9df2f6e5a47cbb2626673086a5aed83be990eae4e17014b70deb8236346"},"schema_version":"1.0","source":{"id":"1308.3242","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3242","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3242v2","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3242","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"5LELYMXU5GDH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5LELYMXU5GDH4J3J","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5LELYMXU","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:6f3e421a63fd817af68581fe14a2b883fafca494c9986fa72053709b22acbbb9","target":"graph","created_at":"2026-05-18T02:30:32Z","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 develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all but finitely many graphs. We also use our method to prove special cases of a conjecture of Kahn. In addition, we show that our method is particularly useful for computing the number of independent sets of small sizes in general regular graphs and Moore graphs, and we argue that it can be used in many other cases when dealing with graphs that have numerous structural restrictions.","authors_text":"James Alexander, Tim Mink","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T20:12:48Z","title":"A new method for enumerating independent sets of a fixed size in general graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3242","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:9ae5aa2589218295b84845a20669cd2a99507062cf1f53186c91ab79ee19466f","target":"record","created_at":"2026-05-18T02:30:32Z","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":"17ccd3ceb0f96ce1ab12b81a69ac2fd7ac3ee94c32f4afe1727e20ec7bc12adc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-14T20:12:48Z","title_canon_sha256":"2dc0d9df2f6e5a47cbb2626673086a5aed83be990eae4e17014b70deb8236346"},"schema_version":"1.0","source":{"id":"1308.3242","kind":"arxiv","version":2}},"canonical_sha256":"eac8bc32f4e9867e27691587e2812e08ca0c054b6dbb208817786709aa460b1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eac8bc32f4e9867e27691587e2812e08ca0c054b6dbb208817786709aa460b1a","first_computed_at":"2026-05-18T02:30:32.546344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:32.546344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jkAQUNCp7NrqQQon+4xGLAiWKbiP2emXaGJSDtwcTqAd8fepy60/bpNJ2x+y/rlYxFeGsYk0DnvX+MkX7FbjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:32.546840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3242","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ae5aa2589218295b84845a20669cd2a99507062cf1f53186c91ab79ee19466f","sha256:6f3e421a63fd817af68581fe14a2b883fafca494c9986fa72053709b22acbbb9"],"state_sha256":"2af609bc5027bbd123bb6cd4683182ae0ad2d821a6bfb4f0fe73cc79230d42cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSLaN35Ra79freFX4Xp/8oG7cTmpg3Z8XStrd5knmQpm2i3QCJgSKN+ZAiaYQAMZpieSBaXlybnNFbp/2AgADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:00:39.675043Z","bundle_sha256":"a3c0a65f415fcfa73796aaf813180efc6eac7cd6280c300212842884cc1d56d6"}}