{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5YLOECYZ2D372CCCC4GU2VKNGU","short_pith_number":"pith:5YLOECYZ","schema_version":"1.0","canonical_sha256":"ee16e20b19d0f7fd0842170d4d554d35129ba9840a471789dbc5adef7692d4fc","source":{"kind":"arxiv","id":"1004.4804","version":1},"attestation_state":"computed","paper":{"title":"When G^2 is a Konig-Egervary graph?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2010-04-27T13:44:55Z","abstract_excerpt":"The square of a graph G is the graph G^2 with the same vertex set as in G, and an edge of G^2 is joining two distinct vertices, whenever the distance between them in G is at most 2. G is a square-stable graph if it enjoys the property alpha(G)=alpha(G^2), where alpha(G) is the size of a maximum stable set in G. In this paper we show that G^2 is a Konig-Egervary graph if and only if G is a square-stable Konig-Egervary graph."},"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":"1004.4804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-04-27T13:44:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4ed9ac7f13d812867c7bcf0ad688cf44fe844890e224cd1762acadbdfab2d1d1","abstract_canon_sha256":"4af095332bd675456ec429412fe1c2280236f6ad67f4a15b39ac8acd3f3d4033"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:15.896110Z","signature_b64":"rRwKKat0SdnenAcVZ8/DvfLWA7lISkFgMqJDhVe2l21pkSCicewBI1G857OnC9uHncvy2By+hrqUWnWfBpRYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee16e20b19d0f7fd0842170d4d554d35129ba9840a471789dbc5adef7692d4fc","last_reissued_at":"2026-05-18T02:24:15.895523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:15.895523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When G^2 is a Konig-Egervary graph?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2010-04-27T13:44:55Z","abstract_excerpt":"The square of a graph G is the graph G^2 with the same vertex set as in G, and an edge of G^2 is joining two distinct vertices, whenever the distance between them in G is at most 2. G is a square-stable graph if it enjoys the property alpha(G)=alpha(G^2), where alpha(G) is the size of a maximum stable set in G. In this paper we show that G^2 is a Konig-Egervary graph if and only if G is a square-stable Konig-Egervary graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4804","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":"1004.4804","created_at":"2026-05-18T02:24:15.895598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.4804v1","created_at":"2026-05-18T02:24:15.895598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4804","created_at":"2026-05-18T02:24:15.895598+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YLOECYZ2D37","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YLOECYZ2D372CCC","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YLOECYZ","created_at":"2026-05-18T12:26:04.259169+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/5YLOECYZ2D372CCCC4GU2VKNGU","json":"https://pith.science/pith/5YLOECYZ2D372CCCC4GU2VKNGU.json","graph_json":"https://pith.science/api/pith-number/5YLOECYZ2D372CCCC4GU2VKNGU/graph.json","events_json":"https://pith.science/api/pith-number/5YLOECYZ2D372CCCC4GU2VKNGU/events.json","paper":"https://pith.science/paper/5YLOECYZ"},"agent_actions":{"view_html":"https://pith.science/pith/5YLOECYZ2D372CCCC4GU2VKNGU","download_json":"https://pith.science/pith/5YLOECYZ2D372CCCC4GU2VKNGU.json","view_paper":"https://pith.science/paper/5YLOECYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.4804&json=true","fetch_graph":"https://pith.science/api/pith-number/5YLOECYZ2D372CCCC4GU2VKNGU/graph.json","fetch_events":"https://pith.science/api/pith-number/5YLOECYZ2D372CCCC4GU2VKNGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YLOECYZ2D372CCCC4GU2VKNGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YLOECYZ2D372CCCC4GU2VKNGU/action/storage_attestation","attest_author":"https://pith.science/pith/5YLOECYZ2D372CCCC4GU2VKNGU/action/author_attestation","sign_citation":"https://pith.science/pith/5YLOECYZ2D372CCCC4GU2VKNGU/action/citation_signature","submit_replication":"https://pith.science/pith/5YLOECYZ2D372CCCC4GU2VKNGU/action/replication_record"}},"created_at":"2026-05-18T02:24:15.895598+00:00","updated_at":"2026-05-18T02:24:15.895598+00:00"}