{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HJ5W4PXSQ4PDIP46VTZBRIPXME","short_pith_number":"pith:HJ5W4PXS","schema_version":"1.0","canonical_sha256":"3a7b6e3ef2871e343f9eacf218a1f76138f1f56c2328a4a3645d8a11e8c23035","source":{"kind":"arxiv","id":"1506.00249","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.00249","created_at":"2026-05-18T01:59:55.084011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00249v1","created_at":"2026-05-18T01:59:55.084011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00249","created_at":"2026-05-18T01:59:55.084011+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJ5W4PXSQ4PD","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJ5W4PXSQ4PDIP46","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJ5W4PXS","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME","json":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME.json","graph_json":"https://pith.science/api/pith-number/HJ5W4PXSQ4PDIP46VTZBRIPXME/graph.json","events_json":"https://pith.science/api/pith-number/HJ5W4PXSQ4PDIP46VTZBRIPXME/events.json","paper":"https://pith.science/paper/HJ5W4PXS"},"agent_actions":{"view_html":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME","download_json":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME.json","view_paper":"https://pith.science/paper/HJ5W4PXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00249&json=true","fetch_graph":"https://pith.science/api/pith-number/HJ5W4PXSQ4PDIP46VTZBRIPXME/graph.json","fetch_events":"https://pith.science/api/pith-number/HJ5W4PXSQ4PDIP46VTZBRIPXME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME/action/storage_attestation","attest_author":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME/action/author_attestation","sign_citation":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME/action/citation_signature","submit_replication":"https://pith.science/pith/HJ5W4PXSQ4PDIP46VTZBRIPXME/action/replication_record"}},"created_at":"2026-05-18T01:59:55.084011+00:00","updated_at":"2026-05-18T01:59:55.084011+00:00"}