{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2HYINVM5X4VGZSEEX2RUXTKDOY","short_pith_number":"pith:2HYINVM5","canonical_record":{"source":{"id":"1506.00255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-31T17:02:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e523fab4de0228d2a488b9f80596384c4dcdce710c8292e8fbd6fcea424d5249","abstract_canon_sha256":"305128b6db2b1bc7d696d937a5dce7f891a9456a9816dd96bde63ae3fc8d71d0"},"schema_version":"1.0"},"canonical_sha256":"d1f086d59dbf2a6cc884bea34bcd43760143260cfe4db8e9ffd0fed7dc57f533","source":{"kind":"arxiv","id":"1506.00255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00255","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00255v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00255","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"2HYINVM5X4VG","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2HYINVM5X4VGZSEE","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2HYINVM5","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2HYINVM5X4VGZSEEX2RUXTKDOY","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-31T17:02:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e523fab4de0228d2a488b9f80596384c4dcdce710c8292e8fbd6fcea424d5249","abstract_canon_sha256":"305128b6db2b1bc7d696d937a5dce7f891a9456a9816dd96bde63ae3fc8d71d0"},"schema_version":"1.0"},"canonical_sha256":"d1f086d59dbf2a6cc884bea34bcd43760143260cfe4db8e9ffd0fed7dc57f533","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:55.064023Z","signature_b64":"NjTSq8VJVBou8/1fYPmMJZ1u93u1Y1iD9ijkvKjcjoZK+IBD7ncdg3BmK60woxpdVbncC463gwOlwaSmJiFrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1f086d59dbf2a6cc884bea34bcd43760143260cfe4db8e9ffd0fed7dc57f533","last_reissued_at":"2026-05-18T01:59:55.063527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:55.063527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00255","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-18T01:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9xa52xTnRwZ/HldAuYSwumVpML3THyTrSlqRyHp9FALlvzKk59bhtE3Nx6LEvLgwauYJSMBDvq/ngfhABRODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:26:33.160436Z"},"content_sha256":"a770c8b308bcdf9e6108be5519755df979c624cbd4c2a0b64b26435032df9cbf","schema_version":"1.0","event_id":"sha256:a770c8b308bcdf9e6108be5519755df979c624cbd4c2a0b64b26435032df9cbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2HYINVM5X4VGZSEEX2RUXTKDOY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Critical and Maximum Independent Sets of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Adi Jarden, Eugen Mandrescu, Vadim E. Levit","submitted_at":"2015-05-31T17:02:01Z","abstract_excerpt":"Let G be a simple graph with vertex set V(G). A subset S of V(G) is independent if no two vertices from S are adjacent. By Ind(G) we mean the family of all independent sets of G while core(G) and corona(G) denote the intersection and the union of all maximum independent sets, respectively. The number d(X)= |X|-|N(X)| is the difference of the set of vertices X, and an independent set A is critical if d(A)=max{d(I):I belongs to Ind(G)} (Zhang, 1990). Let ker(G) and diadem(G) be the intersection and union, respectively, of all critical independent sets of G (Levit and Mandrescu, 2012). In this pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00255","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-18T01:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SzWfBYAUPKXQ4ftXK4ith1QdFW4owOhfWTToPdM2sqIT2tz10ac/D2EhxWya+ITyQxIQ7hIVtuLcIBqk+OTjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:26:33.161093Z"},"content_sha256":"84026fe72a8bc7935eeb08024050b9bbe8e58c1a69c645415826907e8f91acc9","schema_version":"1.0","event_id":"sha256:84026fe72a8bc7935eeb08024050b9bbe8e58c1a69c645415826907e8f91acc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HYINVM5X4VGZSEEX2RUXTKDOY/bundle.json","state_url":"https://pith.science/pith/2HYINVM5X4VGZSEEX2RUXTKDOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HYINVM5X4VGZSEEX2RUXTKDOY/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-30T02:26:33Z","links":{"resolver":"https://pith.science/pith/2HYINVM5X4VGZSEEX2RUXTKDOY","bundle":"https://pith.science/pith/2HYINVM5X4VGZSEEX2RUXTKDOY/bundle.json","state":"https://pith.science/pith/2HYINVM5X4VGZSEEX2RUXTKDOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HYINVM5X4VGZSEEX2RUXTKDOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2HYINVM5X4VGZSEEX2RUXTKDOY","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":"305128b6db2b1bc7d696d937a5dce7f891a9456a9816dd96bde63ae3fc8d71d0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-31T17:02:01Z","title_canon_sha256":"e523fab4de0228d2a488b9f80596384c4dcdce710c8292e8fbd6fcea424d5249"},"schema_version":"1.0","source":{"id":"1506.00255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00255","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00255v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00255","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"2HYINVM5X4VG","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2HYINVM5X4VGZSEE","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2HYINVM5","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:84026fe72a8bc7935eeb08024050b9bbe8e58c1a69c645415826907e8f91acc9","target":"graph","created_at":"2026-05-18T01:59:55Z","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":"Let G be a simple graph with vertex set V(G). A subset S of V(G) is independent if no two vertices from S are adjacent. By Ind(G) we mean the family of all independent sets of G while core(G) and corona(G) denote the intersection and the union of all maximum independent sets, respectively. The number d(X)= |X|-|N(X)| is the difference of the set of vertices X, and an independent set A is critical if d(A)=max{d(I):I belongs to Ind(G)} (Zhang, 1990). Let ker(G) and diadem(G) be the intersection and union, respectively, of all critical independent sets of G (Levit and Mandrescu, 2012). In this pa","authors_text":"Adi Jarden, Eugen Mandrescu, Vadim E. Levit","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-31T17:02:01Z","title":"Critical and Maximum Independent Sets of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00255","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:a770c8b308bcdf9e6108be5519755df979c624cbd4c2a0b64b26435032df9cbf","target":"record","created_at":"2026-05-18T01:59:55Z","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":"305128b6db2b1bc7d696d937a5dce7f891a9456a9816dd96bde63ae3fc8d71d0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-31T17:02:01Z","title_canon_sha256":"e523fab4de0228d2a488b9f80596384c4dcdce710c8292e8fbd6fcea424d5249"},"schema_version":"1.0","source":{"id":"1506.00255","kind":"arxiv","version":1}},"canonical_sha256":"d1f086d59dbf2a6cc884bea34bcd43760143260cfe4db8e9ffd0fed7dc57f533","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1f086d59dbf2a6cc884bea34bcd43760143260cfe4db8e9ffd0fed7dc57f533","first_computed_at":"2026-05-18T01:59:55.063527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:55.063527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NjTSq8VJVBou8/1fYPmMJZ1u93u1Y1iD9ijkvKjcjoZK+IBD7ncdg3BmK60woxpdVbncC463gwOlwaSmJiFrCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:55.064023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a770c8b308bcdf9e6108be5519755df979c624cbd4c2a0b64b26435032df9cbf","sha256:84026fe72a8bc7935eeb08024050b9bbe8e58c1a69c645415826907e8f91acc9"],"state_sha256":"dea4699f420706719597efb2b0f44ae81abd629933dc1a62a91742901491d27f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DpxNxBxlEeZ/hJtCBNbq0zke8eY0cqAQZyd8FgNie/UaPCW0e93fYvyKqOBYISPSREOYGO6uBxUxFgcaEM15AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:26:33.167307Z","bundle_sha256":"3bd7ef330f103b2c4da590ff13f47a889eee230131ed80fda3318120bb9af626"}}