{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YQMV6HY74TS57FRA4S2PSPMIQT","short_pith_number":"pith:YQMV6HY7","schema_version":"1.0","canonical_sha256":"c4195f1f1fe4e5df9620e4b4f93d8884f1afade871eca4d9966a086248783d6a","source":{"kind":"arxiv","id":"2511.20724","version":2},"attestation_state":"computed","paper":{"title":"Hall's Harem Theorem with controlled sizes of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Karol Duda","submitted_at":"2025-11-25T09:09:23Z","abstract_excerpt":"We prove a new version of Hall's Harem Theorem, where the final matching is realized by a unary function with additional conditions on behavior of cycles. The present paper can be considered as a helpful companion of the paper of the author: arXiv:2105.06304, where a computable version of Hall's Harem Theorem with controlled sizes of cycles is proved. These two versions of Hall's Harem Theorem are independent: none of them follows from the other one."},"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":"2511.20724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-11-25T09:09:23Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"595e2be82be36e5c791fe65625b89ec87385103713665d805c4850ac0675763f","abstract_canon_sha256":"1b5c81dddcec6e56d2981ba5c94679c57266094b41bc8e1bfe22d3973e1dc320"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:38.007171Z","signature_b64":"EQ2rbkfLWTcaJfQOpNJ/m4QmIHODFpz0va0Ab7lGpZbWo4YRsUf8ifqcYIUMNrW5GFCXkrEqnNi8zJjPlC5FCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4195f1f1fe4e5df9620e4b4f93d8884f1afade871eca4d9966a086248783d6a","last_reissued_at":"2026-05-20T00:05:38.006288Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:38.006288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hall's Harem Theorem with controlled sizes of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Karol Duda","submitted_at":"2025-11-25T09:09:23Z","abstract_excerpt":"We prove a new version of Hall's Harem Theorem, where the final matching is realized by a unary function with additional conditions on behavior of cycles. The present paper can be considered as a helpful companion of the paper of the author: arXiv:2105.06304, where a computable version of Hall's Harem Theorem with controlled sizes of cycles is proved. These two versions of Hall's Harem Theorem are independent: none of them follows from the other one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.20724","kind":"arxiv","version":2},"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/2511.20724/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":"2511.20724","created_at":"2026-05-20T00:05:38.006451+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.20724v2","created_at":"2026-05-20T00:05:38.006451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.20724","created_at":"2026-05-20T00:05:38.006451+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQMV6HY74TS5","created_at":"2026-05-20T00:05:38.006451+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQMV6HY74TS57FRA","created_at":"2026-05-20T00:05:38.006451+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQMV6HY7","created_at":"2026-05-20T00:05:38.006451+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/YQMV6HY74TS57FRA4S2PSPMIQT","json":"https://pith.science/pith/YQMV6HY74TS57FRA4S2PSPMIQT.json","graph_json":"https://pith.science/api/pith-number/YQMV6HY74TS57FRA4S2PSPMIQT/graph.json","events_json":"https://pith.science/api/pith-number/YQMV6HY74TS57FRA4S2PSPMIQT/events.json","paper":"https://pith.science/paper/YQMV6HY7"},"agent_actions":{"view_html":"https://pith.science/pith/YQMV6HY74TS57FRA4S2PSPMIQT","download_json":"https://pith.science/pith/YQMV6HY74TS57FRA4S2PSPMIQT.json","view_paper":"https://pith.science/paper/YQMV6HY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.20724&json=true","fetch_graph":"https://pith.science/api/pith-number/YQMV6HY74TS57FRA4S2PSPMIQT/graph.json","fetch_events":"https://pith.science/api/pith-number/YQMV6HY74TS57FRA4S2PSPMIQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQMV6HY74TS57FRA4S2PSPMIQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQMV6HY74TS57FRA4S2PSPMIQT/action/storage_attestation","attest_author":"https://pith.science/pith/YQMV6HY74TS57FRA4S2PSPMIQT/action/author_attestation","sign_citation":"https://pith.science/pith/YQMV6HY74TS57FRA4S2PSPMIQT/action/citation_signature","submit_replication":"https://pith.science/pith/YQMV6HY74TS57FRA4S2PSPMIQT/action/replication_record"}},"created_at":"2026-05-20T00:05:38.006451+00:00","updated_at":"2026-05-20T00:05:38.006451+00:00"}