{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SG63FWEVWJ5C7HSLFTVEUUHXCG","short_pith_number":"pith:SG63FWEV","schema_version":"1.0","canonical_sha256":"91bdb2d895b27a2f9e4b2cea4a50f711a91c142f4ba6727a42439276a260b119","source":{"kind":"arxiv","id":"1804.03949","version":1},"attestation_state":"computed","paper":{"title":"Some Applications of $S$-restricted Set Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Be\\'ata B\\'enyi, Jos\\'e L. Ram\\'irez","submitted_at":"2018-04-11T11:59:36Z","abstract_excerpt":"In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of the main applications is in the study of lonesum matrices."},"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":"1804.03949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T11:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"1126d41fbe6334ff154f36b3d32aa90539621106b321258ecb6b50b97fc8afba","abstract_canon_sha256":"6916d05a1af0ceb6f4b98fdcdc0664b5c99f5bf5b5b57b4fd6d1fc3ffc4c1236"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:42.596104Z","signature_b64":"+fCc1PTZ2K29KSq3mBSTntnToz8rVE71/Z9fJXf+FG/7lfUA3kNkSdP38fPNeYMeEpGWxfcwEK0cicnF1osWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91bdb2d895b27a2f9e4b2cea4a50f711a91c142f4ba6727a42439276a260b119","last_reissued_at":"2026-05-18T00:18:42.595397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:42.595397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Applications of $S$-restricted Set Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Be\\'ata B\\'enyi, Jos\\'e L. Ram\\'irez","submitted_at":"2018-04-11T11:59:36Z","abstract_excerpt":"In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of the main applications is in the study of lonesum matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03949","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":"1804.03949","created_at":"2026-05-18T00:18:42.595510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03949v1","created_at":"2026-05-18T00:18:42.595510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03949","created_at":"2026-05-18T00:18:42.595510+00:00"},{"alias_kind":"pith_short_12","alias_value":"SG63FWEVWJ5C","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SG63FWEVWJ5C7HSL","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SG63FWEV","created_at":"2026-05-18T12:32:53.628368+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/SG63FWEVWJ5C7HSLFTVEUUHXCG","json":"https://pith.science/pith/SG63FWEVWJ5C7HSLFTVEUUHXCG.json","graph_json":"https://pith.science/api/pith-number/SG63FWEVWJ5C7HSLFTVEUUHXCG/graph.json","events_json":"https://pith.science/api/pith-number/SG63FWEVWJ5C7HSLFTVEUUHXCG/events.json","paper":"https://pith.science/paper/SG63FWEV"},"agent_actions":{"view_html":"https://pith.science/pith/SG63FWEVWJ5C7HSLFTVEUUHXCG","download_json":"https://pith.science/pith/SG63FWEVWJ5C7HSLFTVEUUHXCG.json","view_paper":"https://pith.science/paper/SG63FWEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03949&json=true","fetch_graph":"https://pith.science/api/pith-number/SG63FWEVWJ5C7HSLFTVEUUHXCG/graph.json","fetch_events":"https://pith.science/api/pith-number/SG63FWEVWJ5C7HSLFTVEUUHXCG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SG63FWEVWJ5C7HSLFTVEUUHXCG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SG63FWEVWJ5C7HSLFTVEUUHXCG/action/storage_attestation","attest_author":"https://pith.science/pith/SG63FWEVWJ5C7HSLFTVEUUHXCG/action/author_attestation","sign_citation":"https://pith.science/pith/SG63FWEVWJ5C7HSLFTVEUUHXCG/action/citation_signature","submit_replication":"https://pith.science/pith/SG63FWEVWJ5C7HSLFTVEUUHXCG/action/replication_record"}},"created_at":"2026-05-18T00:18:42.595510+00:00","updated_at":"2026-05-18T00:18:42.595510+00:00"}