{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S5PGT5K2O7UA55LNNEAMAXLPZJ","short_pith_number":"pith:S5PGT5K2","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"},"canonical_sha256":"975e69f55a77e80ef56d6900c05d6fca72290abeec57b502976c487ff57b5df7","source":{"kind":"arxiv","id":"1604.05839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05839","created_at":"2026-05-18T01:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05839v1","created_at":"2026-05-18T01:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05839","created_at":"2026-05-18T01:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"S5PGT5K2O7UA","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S5PGT5K2O7UA55LN","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S5PGT5K2","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S5PGT5K2O7UA55LNNEAMAXLPZJ","target":"record","payload":{"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"},"canonical_sha256":"975e69f55a77e80ef56d6900c05d6fca72290abeec57b502976c487ff57b5df7","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"},"source_kind":"arxiv","source_id":"1604.05839","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lyyq2IOYoBFs9h0Dtr4WAeHoENFQJ/glDFw0HjNyDXgUO1bVn26Un1AkWg1u0hD+6oF1mAtixNf9k7bkLYzPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:25:43.399543Z"},"content_sha256":"ae3359d6a20ded5a84391fb8cf394b3377a7b34ad8839bfde04e40ff838944ad","schema_version":"1.0","event_id":"sha256:ae3359d6a20ded5a84391fb8cf394b3377a7b34ad8839bfde04e40ff838944ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S5PGT5K2O7UA55LNNEAMAXLPZJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnWyZqvHJd3qXJT4sdIgdtmkjDnKpZbgrmp+V02fMLvXSJ+WFmvawIANgK0SVlG6n4qycPngQRRzx4L/h4Q+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:25:43.400194Z"},"content_sha256":"d0fd060cf47f559c52af8e74dc445922c60bb44e4e9588c9a42121622882b5c6","schema_version":"1.0","event_id":"sha256:d0fd060cf47f559c52af8e74dc445922c60bb44e4e9588c9a42121622882b5c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ/bundle.json","state_url":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T23:25:43Z","links":{"resolver":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ","bundle":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ/bundle.json","state":"https://pith.science/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5PGT5K2O7UA55LNNEAMAXLPZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S5PGT5K2O7UA55LNNEAMAXLPZJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"16be540f5f56c3478ef66d1dcf2117c86e966ab6d6474d6419514af66aa9fdae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-20T06:36:41Z","title_canon_sha256":"1182389fcb5aa11607b166acde0a0b62e7f36eb8d3fc9a43c08c40b6038340b2"},"schema_version":"1.0","source":{"id":"1604.05839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05839","created_at":"2026-05-18T01:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05839v1","created_at":"2026-05-18T01:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05839","created_at":"2026-05-18T01:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"S5PGT5K2O7UA","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S5PGT5K2O7UA55LN","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S5PGT5K2","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:d0fd060cf47f559c52af8e74dc445922c60bb44e4e9588c9a42121622882b5c6","target":"graph","created_at":"2026-05-18T01:16:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Djamila Oudrar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-20T06:36:41Z","title":"Sur l'\\'enum\\'eration de structures discr\\`etes, une approche par la th\\'eorie des relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05839","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ae3359d6a20ded5a84391fb8cf394b3377a7b34ad8839bfde04e40ff838944ad","target":"record","created_at":"2026-05-18T01:16:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"16be540f5f56c3478ef66d1dcf2117c86e966ab6d6474d6419514af66aa9fdae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-20T06:36:41Z","title_canon_sha256":"1182389fcb5aa11607b166acde0a0b62e7f36eb8d3fc9a43c08c40b6038340b2"},"schema_version":"1.0","source":{"id":"1604.05839","kind":"arxiv","version":1}},"canonical_sha256":"975e69f55a77e80ef56d6900c05d6fca72290abeec57b502976c487ff57b5df7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"975e69f55a77e80ef56d6900c05d6fca72290abeec57b502976c487ff57b5df7","first_computed_at":"2026-05-18T01:16:35.347228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:35.347228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vd/Lcwx7KLDZi5f3sBt9mSC8XO5xhrKcOq5GhOGmPcngwQJHlghFk0Ku+qrm242dF/i04nHKyFW+R2lDVuKSCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:35.347953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.05839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae3359d6a20ded5a84391fb8cf394b3377a7b34ad8839bfde04e40ff838944ad","sha256:d0fd060cf47f559c52af8e74dc445922c60bb44e4e9588c9a42121622882b5c6"],"state_sha256":"009eb814ad09ad3b22fca75375eb601673d540ae8fadd1076e829c56787db3c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CmWujQsnQcNAjM+7hkGOkIN0ZUz8ViBn50oqF8eqeA7+I7vGmdHDAxXFJJ69UKkyNGJ9Kk2djftLSTlQJmclCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:25:43.403676Z","bundle_sha256":"b0a8ed31d95f667991157055aec5a99455b8012a079d842a8689d55388f1fb5c"}}