{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EQ4WIQCPSIUDB5YQ7N7PIINYH4","short_pith_number":"pith:EQ4WIQCP","canonical_record":{"source":{"id":"1412.0940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-02T15:06:35Z","cross_cats_sorted":[],"title_canon_sha256":"6f50944bb52f3843c45b40ad0654db780bdf4197cc6cb81983c2f81af2ad8327","abstract_canon_sha256":"0c7a122b5cb1fe138924d7501d19a7906495575a58daad1729ac0b8f96f42865"},"schema_version":"1.0"},"canonical_sha256":"243964404f922830f710fb7ef421b83f136ae4e0d186b7b25f4c53ec95d0d261","source":{"kind":"arxiv","id":"1412.0940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0940","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0940v1","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0940","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"EQ4WIQCPSIUD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EQ4WIQCPSIUDB5YQ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EQ4WIQCP","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EQ4WIQCPSIUDB5YQ7N7PIINYH4","target":"record","payload":{"canonical_record":{"source":{"id":"1412.0940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-02T15:06:35Z","cross_cats_sorted":[],"title_canon_sha256":"6f50944bb52f3843c45b40ad0654db780bdf4197cc6cb81983c2f81af2ad8327","abstract_canon_sha256":"0c7a122b5cb1fe138924d7501d19a7906495575a58daad1729ac0b8f96f42865"},"schema_version":"1.0"},"canonical_sha256":"243964404f922830f710fb7ef421b83f136ae4e0d186b7b25f4c53ec95d0d261","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:15.340644Z","signature_b64":"zqRONVS4ldwVz2VWf+wbndk/VwuNegKyJvt5u5XGfcyTelYACr1zbd6VRun4u4bn+Vyw1dUoUkBrtIZDww7jBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"243964404f922830f710fb7ef421b83f136ae4e0d186b7b25f4c53ec95d0d261","last_reissued_at":"2026-05-18T02:32:15.340023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:15.340023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.0940","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-18T02:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eHPYSeTurhABppk46ceQmxPAt19oXiHY1n2/X62mxfs/fjsCCcRH98u8Om/4KZ1w8YkliCOQJd0TQaSYQG01BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:25:51.520812Z"},"content_sha256":"3b5930c807efa48ba0b50d07fcda808c5a9212a76bcd72e74caf109e2217199e","schema_version":"1.0","event_id":"sha256:3b5930c807efa48ba0b50d07fcda808c5a9212a76bcd72e74caf109e2217199e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EQ4WIQCPSIUDB5YQ7N7PIINYH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting independent sets in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wojciech Samotij","submitted_at":"2014-12-02T15:06:35Z","abstract_excerpt":"In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used numerous times by many researchers in various contexts. Our presentation of the method is illustrated with several applications of it to `real-life' combinatorial problems. In particular, we derive bounds on the number of independent sets in regular graphs, sum-free subsets of $\\{1, \\ldots, n\\}$, and $C_4$-free graphs and give a short proof of an analogue of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0940","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-18T02:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dH4NrcTHo8qPJNzXjvemF27WU37XaRMdxDLM88Pp/0XWGfyBFX7WwwK23fgRcavm73PU7WnlzQBLBNABxt2NDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:25:51.521215Z"},"content_sha256":"3a47a1c23b5fd3e65a0c09badb6e547fa8f56ff44ad8efcb714e3bd4e0e8c88b","schema_version":"1.0","event_id":"sha256:3a47a1c23b5fd3e65a0c09badb6e547fa8f56ff44ad8efcb714e3bd4e0e8c88b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQ4WIQCPSIUDB5YQ7N7PIINYH4/bundle.json","state_url":"https://pith.science/pith/EQ4WIQCPSIUDB5YQ7N7PIINYH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQ4WIQCPSIUDB5YQ7N7PIINYH4/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-27T06:25:51Z","links":{"resolver":"https://pith.science/pith/EQ4WIQCPSIUDB5YQ7N7PIINYH4","bundle":"https://pith.science/pith/EQ4WIQCPSIUDB5YQ7N7PIINYH4/bundle.json","state":"https://pith.science/pith/EQ4WIQCPSIUDB5YQ7N7PIINYH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQ4WIQCPSIUDB5YQ7N7PIINYH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EQ4WIQCPSIUDB5YQ7N7PIINYH4","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":"0c7a122b5cb1fe138924d7501d19a7906495575a58daad1729ac0b8f96f42865","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-02T15:06:35Z","title_canon_sha256":"6f50944bb52f3843c45b40ad0654db780bdf4197cc6cb81983c2f81af2ad8327"},"schema_version":"1.0","source":{"id":"1412.0940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0940","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0940v1","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0940","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"EQ4WIQCPSIUD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EQ4WIQCPSIUDB5YQ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EQ4WIQCP","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:3a47a1c23b5fd3e65a0c09badb6e547fa8f56ff44ad8efcb714e3bd4e0e8c88b","target":"graph","created_at":"2026-05-18T02:32:15Z","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":"In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used numerous times by many researchers in various contexts. Our presentation of the method is illustrated with several applications of it to `real-life' combinatorial problems. In particular, we derive bounds on the number of independent sets in regular graphs, sum-free subsets of $\\{1, \\ldots, n\\}$, and $C_4$-free graphs and give a short proof of an analogue of","authors_text":"Wojciech Samotij","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-02T15:06:35Z","title":"Counting independent sets in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0940","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:3b5930c807efa48ba0b50d07fcda808c5a9212a76bcd72e74caf109e2217199e","target":"record","created_at":"2026-05-18T02:32:15Z","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":"0c7a122b5cb1fe138924d7501d19a7906495575a58daad1729ac0b8f96f42865","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-02T15:06:35Z","title_canon_sha256":"6f50944bb52f3843c45b40ad0654db780bdf4197cc6cb81983c2f81af2ad8327"},"schema_version":"1.0","source":{"id":"1412.0940","kind":"arxiv","version":1}},"canonical_sha256":"243964404f922830f710fb7ef421b83f136ae4e0d186b7b25f4c53ec95d0d261","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"243964404f922830f710fb7ef421b83f136ae4e0d186b7b25f4c53ec95d0d261","first_computed_at":"2026-05-18T02:32:15.340023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:15.340023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zqRONVS4ldwVz2VWf+wbndk/VwuNegKyJvt5u5XGfcyTelYACr1zbd6VRun4u4bn+Vyw1dUoUkBrtIZDww7jBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:15.340644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b5930c807efa48ba0b50d07fcda808c5a9212a76bcd72e74caf109e2217199e","sha256:3a47a1c23b5fd3e65a0c09badb6e547fa8f56ff44ad8efcb714e3bd4e0e8c88b"],"state_sha256":"a4ec6fef1b3d0da5060aab02da49723d0f8adee3e143b31db61a5caa73c47a79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nbt1u/fROGkpVOrw3u2sWwo79kb/Nh9OGj5M1Z2rgV6TQcwwjFuRn3pquAv120n8FmlZuoOBv6vvxxKztB8LDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:25:51.524100Z","bundle_sha256":"cca61387776ee57503e0a6c6ace4878929ca841b5d4d91e7037c33bced543d5e"}}