{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:S5PGT5K2O7UA55LNNEAMAXLPZJ","short_pith_number":"pith:S5PGT5K2","schema_version":"1.0","canonical_sha256":"975e69f55a77e80ef56d6900c05d6fca72290abeec57b502976c487ff57b5df7","source":{"kind":"arxiv","id":"1604.05839","version":1},"attestation_state":"computed","paper":{"title":"Sur l'\\'enum\\'eration de structures discr\\`etes, une approche par la th\\'eorie des relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Djamila Oudrar","submitted_at":"2016-04-20T06:36:41Z","abstract_excerpt":"Theory of relations is the framework of this thesis. It is about enumeration of finite structures. Let $\\mathscr C$ be a class of finite combinatorial structures, the \\emph{profile} of $\\mathscr C$ is the function $\\varphi_{\\mathscr C}$ which count, for every $n$, the number of members of $\\mathscr{C}$ defined on $n$ elements, isomorphic structures been identified. The generating function for $\\mathscr C$ is $\\mathcal H_{\\mathscr C}(X):=\\sum_{n\\geqq 0}\\varphi_{\\mathscr C}(n)X^n$. Many results about the behavior of the function $\\varphi_{\\mathscr C}$ have been obtained. Albert and Atkinson have"},"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":"1604.05839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-20T06:36:41Z","cross_cats_sorted":[],"title_canon_sha256":"1182389fcb5aa11607b166acde0a0b62e7f36eb8d3fc9a43c08c40b6038340b2","abstract_canon_sha256":"16be540f5f56c3478ef66d1dcf2117c86e966ab6d6474d6419514af66aa9fdae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:35.347953Z","signature_b64":"vd/Lcwx7KLDZi5f3sBt9mSC8XO5xhrKcOq5GhOGmPcngwQJHlghFk0Ku+qrm242dF/i04nHKyFW+R2lDVuKSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"975e69f55a77e80ef56d6900c05d6fca72290abeec57b502976c487ff57b5df7","last_reissued_at":"2026-05-18T01:16:35.347228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:35.347228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sur l'\\'enum\\'eration de structures discr\\`etes, une approche par la th\\'eorie des relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Djamila Oudrar","submitted_at":"2016-04-20T06:36:41Z","abstract_excerpt":"Theory of relations is the framework of this thesis. It is about enumeration of finite structures. Let $\\mathscr C$ be a class of finite combinatorial structures, the \\emph{profile} of $\\mathscr C$ is the function $\\varphi_{\\mathscr C}$ which count, for every $n$, the number of members of $\\mathscr{C}$ defined on $n$ elements, isomorphic structures been identified. The generating function for $\\mathscr C$ is $\\mathcal H_{\\mathscr C}(X):=\\sum_{n\\geqq 0}\\varphi_{\\mathscr C}(n)X^n$. Many results about the behavior of the function $\\varphi_{\\mathscr C}$ have been obtained. Albert and Atkinson have"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05839","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":"1604.05839","created_at":"2026-05-18T01:16:35.347354+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05839v1","created_at":"2026-05-18T01:16:35.347354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05839","created_at":"2026-05-18T01:16:35.347354+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5PGT5K2O7UA","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5PGT5K2O7UA55LN","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5PGT5K2","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2211.12397","citing_title":"Uncountably many enumerations of well-quasi-ordered permutation classes","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ","json":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ.json","graph_json":"https://pith.science/api/pith-number/S5PGT5K2O7UA55LNNEAMAXLPZJ/graph.json","events_json":"https://pith.science/api/pith-number/S5PGT5K2O7UA55LNNEAMAXLPZJ/events.json","paper":"https://pith.science/paper/S5PGT5K2"},"agent_actions":{"view_html":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ","download_json":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ.json","view_paper":"https://pith.science/paper/S5PGT5K2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05839&json=true","fetch_graph":"https://pith.science/api/pith-number/S5PGT5K2O7UA55LNNEAMAXLPZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/S5PGT5K2O7UA55LNNEAMAXLPZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ/action/storage_attestation","attest_author":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ/action/author_attestation","sign_citation":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ/action/citation_signature","submit_replication":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ/action/replication_record"}},"created_at":"2026-05-18T01:16:35.347354+00:00","updated_at":"2026-05-18T01:16:35.347354+00:00"}