{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HJ5W4PXSQ4PDIP46VTZBRIPXME","short_pith_number":"pith:HJ5W4PXS","canonical_record":{"source":{"id":"1506.00249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-31T16:09:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9347c61de60021c5671792e364c59d0d4d444c302a58592b6b9395f6e5135502","abstract_canon_sha256":"8532d1fa9dd1d862da287329758e6d025c0e6e2ec16f8ae4f38a198aaab38d86"},"schema_version":"1.0"},"canonical_sha256":"3a7b6e3ef2871e343f9eacf218a1f76138f1f56c2328a4a3645d8a11e8c23035","source":{"kind":"arxiv","id":"1506.00249","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00249","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00249v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00249","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"HJ5W4PXSQ4PD","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HJ5W4PXSQ4PDIP46","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HJ5W4PXS","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HJ5W4PXSQ4PDIP46VTZBRIPXME","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-31T16:09:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9347c61de60021c5671792e364c59d0d4d444c302a58592b6b9395f6e5135502","abstract_canon_sha256":"8532d1fa9dd1d862da287329758e6d025c0e6e2ec16f8ae4f38a198aaab38d86"},"schema_version":"1.0"},"canonical_sha256":"3a7b6e3ef2871e343f9eacf218a1f76138f1f56c2328a4a3645d8a11e8c23035","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:55.084435Z","signature_b64":"0uDtA/2SDKQ2JtEtbOZ8MG5GqnP3JuWtGpU0UYKXmtVEyv9ScV+ho/84WI3XIAlxQwtWbzTJOz1vxtWPNHHYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a7b6e3ef2871e343f9eacf218a1f76138f1f56c2328a4a3645d8a11e8c23035","last_reissued_at":"2026-05-18T01:59:55.083936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:55.083936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00249","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":"h9mCEvy3J4y+lR3M3bIWFf6BY3XtC3eRxQA5/IwjVSDs+fqSSmkJf0TmvznSS/H4hch6nMq88vl09H8Ftq94AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:53:04.807584Z"},"content_sha256":"2c0bf3db2d0d6dc36f937a84d328cfaacb793b200dba8550043f95452cb4e83f","schema_version":"1.0","event_id":"sha256:2c0bf3db2d0d6dc36f937a84d328cfaacb793b200dba8550043f95452cb4e83f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HJ5W4PXSQ4PDIP46VTZBRIPXME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monotonic Properties of Collections of 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-31T16:09:17Z","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. The graph G is known to be a Konig-Egervary if alpha(G) + mu(G)= |V(G)|, where alpha(G) denotes the size of a maximum independent set and mu(G) is the cardinality of a maximum matching. Let Omega(G) denote the family of all maximum independent sets, and f be the function from the set of subcollections Gamma of Omega(G) such that f(Gamma) = (the cardinality of the union of elements of Gamma) + (the cardinality of the intersection of elements of Gamma). Our main finding claims "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00249","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":"mN1+7Vx4m0g5qM3oTkIPuOUejWgm71QZ8uIA9ClvxO/8zUhvn6swGEIyc7OubuEFJRlC6uywMlJTwC8IFNaeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:53:04.808246Z"},"content_sha256":"64454b35faea5b4f9a90490dfa3d611c91d09944b53e6bf79c08d571d8e9cae0","schema_version":"1.0","event_id":"sha256:64454b35faea5b4f9a90490dfa3d611c91d09944b53e6bf79c08d571d8e9cae0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME/bundle.json","state_url":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME/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-29T19:53:04Z","links":{"resolver":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME","bundle":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME/bundle.json","state":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HJ5W4PXSQ4PDIP46VTZBRIPXME","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":"8532d1fa9dd1d862da287329758e6d025c0e6e2ec16f8ae4f38a198aaab38d86","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-31T16:09:17Z","title_canon_sha256":"9347c61de60021c5671792e364c59d0d4d444c302a58592b6b9395f6e5135502"},"schema_version":"1.0","source":{"id":"1506.00249","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00249","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00249v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00249","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"HJ5W4PXSQ4PD","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HJ5W4PXSQ4PDIP46","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HJ5W4PXS","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:64454b35faea5b4f9a90490dfa3d611c91d09944b53e6bf79c08d571d8e9cae0","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. The graph G is known to be a Konig-Egervary if alpha(G) + mu(G)= |V(G)|, where alpha(G) denotes the size of a maximum independent set and mu(G) is the cardinality of a maximum matching. Let Omega(G) denote the family of all maximum independent sets, and f be the function from the set of subcollections Gamma of Omega(G) such that f(Gamma) = (the cardinality of the union of elements of Gamma) + (the cardinality of the intersection of elements of Gamma). Our main finding claims ","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-31T16:09:17Z","title":"Monotonic Properties of Collections of Maximum Independent Sets of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00249","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:2c0bf3db2d0d6dc36f937a84d328cfaacb793b200dba8550043f95452cb4e83f","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":"8532d1fa9dd1d862da287329758e6d025c0e6e2ec16f8ae4f38a198aaab38d86","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-31T16:09:17Z","title_canon_sha256":"9347c61de60021c5671792e364c59d0d4d444c302a58592b6b9395f6e5135502"},"schema_version":"1.0","source":{"id":"1506.00249","kind":"arxiv","version":1}},"canonical_sha256":"3a7b6e3ef2871e343f9eacf218a1f76138f1f56c2328a4a3645d8a11e8c23035","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a7b6e3ef2871e343f9eacf218a1f76138f1f56c2328a4a3645d8a11e8c23035","first_computed_at":"2026-05-18T01:59:55.083936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:55.083936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0uDtA/2SDKQ2JtEtbOZ8MG5GqnP3JuWtGpU0UYKXmtVEyv9ScV+ho/84WI3XIAlxQwtWbzTJOz1vxtWPNHHYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:55.084435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00249","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c0bf3db2d0d6dc36f937a84d328cfaacb793b200dba8550043f95452cb4e83f","sha256:64454b35faea5b4f9a90490dfa3d611c91d09944b53e6bf79c08d571d8e9cae0"],"state_sha256":"58ff35bf26c78f74c1a9ec383cabdeb784d022dc5f41305f547bed9b9ca19a41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DBoc1f7qdFFG2l/S6eQQAtauRewdyu8lfnz3sVFgZVKiOjDkqhL2DrjNmuF9pa5o1bqlqfE8NtATs+qhHr81CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:53:04.811532Z","bundle_sha256":"bf48090ea0847a18856849ce81e0579f80e63af8f4452374404bb939fd7b051f"}}