{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:QNHN7DAEPRIORICXPB77WTTURT","short_pith_number":"pith:QNHN7DAE","schema_version":"1.0","canonical_sha256":"834edf8c047c50e8a057787ffb4e748cc2a611073b798af658ee66fc6345128c","source":{"kind":"arxiv","id":"2105.14339","version":1},"attestation_state":"computed","paper":{"title":"Graphs whose all maximal induced forests are of the same order","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Reza Jafarpour-Golzari","submitted_at":"2021-05-29T16:55:58Z","abstract_excerpt":"In this paper, a new concept in graphs namely well-f-coveredness is introduced. We characterize all graphs with such property, whose maximum induced forests are of boundary order. Also we prove several propositions concerning with obtaining large well-f-covered graphs from smaller ones. By the way, some interesting classes of well-f-covered graphs are characterized."},"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":"2105.14339","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-05-29T16:55:58Z","cross_cats_sorted":[],"title_canon_sha256":"f57b2771dc8c6b1b854a2d6a6fc737a7b59880a43116ce99c3e82ac670319524","abstract_canon_sha256":"32b223a023bc0710c7297caf4ab8afc2a57b39a30b9d4e2015c55fd54ecbf9e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:44:22.833244Z","signature_b64":"h38fV28Z8fCGHUU1FrfnFw8MvvT4Vx8JEF95DGvXqwkQ5+XbuE6MDRp34hnCDA8Q0AQKc3VFJYFonJTdnCNVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"834edf8c047c50e8a057787ffb4e748cc2a611073b798af658ee66fc6345128c","last_reissued_at":"2026-07-05T02:44:22.832765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:44:22.832765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs whose all maximal induced forests are of the same order","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Reza Jafarpour-Golzari","submitted_at":"2021-05-29T16:55:58Z","abstract_excerpt":"In this paper, a new concept in graphs namely well-f-coveredness is introduced. We characterize all graphs with such property, whose maximum induced forests are of boundary order. Also we prove several propositions concerning with obtaining large well-f-covered graphs from smaller ones. By the way, some interesting classes of well-f-covered graphs are characterized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.14339","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.14339/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.14339","created_at":"2026-07-05T02:44:22.832822+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.14339v1","created_at":"2026-07-05T02:44:22.832822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.14339","created_at":"2026-07-05T02:44:22.832822+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNHN7DAEPRIO","created_at":"2026-07-05T02:44:22.832822+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNHN7DAEPRIORICX","created_at":"2026-07-05T02:44:22.832822+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNHN7DAE","created_at":"2026-07-05T02:44:22.832822+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03480","citing_title":"Efficient Multilingual Neural Machine Translation via Corpus-Driven Vocabulary Pruning: An English-Arabic Case Study","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QNHN7DAEPRIORICXPB77WTTURT","json":"https://pith.science/pith/QNHN7DAEPRIORICXPB77WTTURT.json","graph_json":"https://pith.science/api/pith-number/QNHN7DAEPRIORICXPB77WTTURT/graph.json","events_json":"https://pith.science/api/pith-number/QNHN7DAEPRIORICXPB77WTTURT/events.json","paper":"https://pith.science/paper/QNHN7DAE"},"agent_actions":{"view_html":"https://pith.science/pith/QNHN7DAEPRIORICXPB77WTTURT","download_json":"https://pith.science/pith/QNHN7DAEPRIORICXPB77WTTURT.json","view_paper":"https://pith.science/paper/QNHN7DAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.14339&json=true","fetch_graph":"https://pith.science/api/pith-number/QNHN7DAEPRIORICXPB77WTTURT/graph.json","fetch_events":"https://pith.science/api/pith-number/QNHN7DAEPRIORICXPB77WTTURT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNHN7DAEPRIORICXPB77WTTURT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNHN7DAEPRIORICXPB77WTTURT/action/storage_attestation","attest_author":"https://pith.science/pith/QNHN7DAEPRIORICXPB77WTTURT/action/author_attestation","sign_citation":"https://pith.science/pith/QNHN7DAEPRIORICXPB77WTTURT/action/citation_signature","submit_replication":"https://pith.science/pith/QNHN7DAEPRIORICXPB77WTTURT/action/replication_record"}},"created_at":"2026-07-05T02:44:22.832822+00:00","updated_at":"2026-07-05T02:44:22.832822+00:00"}