{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MVBIHH7URAJHQPY3JWE47HKLW4","short_pith_number":"pith:MVBIHH7U","canonical_record":{"source":{"id":"1802.01419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-05T14:33:36Z","cross_cats_sorted":[],"title_canon_sha256":"bd1804e03257dd72a4be37f454327bd84e9fa8726871ccbb222b92743b086145","abstract_canon_sha256":"8771cec90e5e1303f092e66178e1c141fe61aebac028258db0c30d3cab823c8e"},"schema_version":"1.0"},"canonical_sha256":"6542839ff48812783f1b4d89cf9d4bb71a1579620c614b7aaabff0bf34b0e013","source":{"kind":"arxiv","id":"1802.01419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01419","created_at":"2026-05-18T00:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01419v1","created_at":"2026-05-18T00:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01419","created_at":"2026-05-18T00:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"MVBIHH7URAJH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MVBIHH7URAJHQPY3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MVBIHH7U","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MVBIHH7URAJHQPY3JWE47HKLW4","target":"record","payload":{"canonical_record":{"source":{"id":"1802.01419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-05T14:33:36Z","cross_cats_sorted":[],"title_canon_sha256":"bd1804e03257dd72a4be37f454327bd84e9fa8726871ccbb222b92743b086145","abstract_canon_sha256":"8771cec90e5e1303f092e66178e1c141fe61aebac028258db0c30d3cab823c8e"},"schema_version":"1.0"},"canonical_sha256":"6542839ff48812783f1b4d89cf9d4bb71a1579620c614b7aaabff0bf34b0e013","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:26.438865Z","signature_b64":"CGtsKWAUfWDR0/a+tnntOVtk3vn5feJFqxozVxE6KvThITR9l/4aKi0q4Yl5C+kgCyBoNbgdwZ2FhtT5d8PWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6542839ff48812783f1b4d89cf9d4bb71a1579620c614b7aaabff0bf34b0e013","last_reissued_at":"2026-05-18T00:24:26.438388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:26.438388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.01419","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-18T00:24:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zi9fVy9zfiEpLJmGBLrNQY9ME7nkiubU/l1OF3jxPjrlLq1ROI9+YDjSK8njvFmdHXrjDMDO79fec5ZpibgmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:15:57.909225Z"},"content_sha256":"a5fe8769153c30dae447ce240878e8848587be44b0dfc817c715243ad9081ddc","schema_version":"1.0","event_id":"sha256:a5fe8769153c30dae447ce240878e8848587be44b0dfc817c715243ad9081ddc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MVBIHH7URAJHQPY3JWE47HKLW4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential functions of finite posets and the number of extensions with a fixed set of minimal points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Frank a Campo, Marcel Ern\\'e","submitted_at":"2018-02-05T14:33:36Z","abstract_excerpt":"We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points and inducing the poset P on the non- minimal points. It turns out that these counting functions are closely related to a collection of downset numbers of certain subposets. Since any function of that kind is an exponential sum (with the number of minimal points as exponent), we call it the exponential function of the poset. Some linear equations, divisibilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01419","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-18T00:24:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxLSuQE5R6S25irM9umpxIFve6WPlVB614C5F3Zbu7bRgASizV7qwwCuZwQDjh623jh176a4YrAKF6fkl786DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:15:57.909577Z"},"content_sha256":"2bdae94b800db0ca3c20ede4517eaa1ab12b8d8e70c13745becd72aefdd1d78a","schema_version":"1.0","event_id":"sha256:2bdae94b800db0ca3c20ede4517eaa1ab12b8d8e70c13745becd72aefdd1d78a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVBIHH7URAJHQPY3JWE47HKLW4/bundle.json","state_url":"https://pith.science/pith/MVBIHH7URAJHQPY3JWE47HKLW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVBIHH7URAJHQPY3JWE47HKLW4/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-06-09T12:15:57Z","links":{"resolver":"https://pith.science/pith/MVBIHH7URAJHQPY3JWE47HKLW4","bundle":"https://pith.science/pith/MVBIHH7URAJHQPY3JWE47HKLW4/bundle.json","state":"https://pith.science/pith/MVBIHH7URAJHQPY3JWE47HKLW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVBIHH7URAJHQPY3JWE47HKLW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MVBIHH7URAJHQPY3JWE47HKLW4","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":"8771cec90e5e1303f092e66178e1c141fe61aebac028258db0c30d3cab823c8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-05T14:33:36Z","title_canon_sha256":"bd1804e03257dd72a4be37f454327bd84e9fa8726871ccbb222b92743b086145"},"schema_version":"1.0","source":{"id":"1802.01419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01419","created_at":"2026-05-18T00:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01419v1","created_at":"2026-05-18T00:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01419","created_at":"2026-05-18T00:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"MVBIHH7URAJH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MVBIHH7URAJHQPY3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MVBIHH7U","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:2bdae94b800db0ca3c20ede4517eaa1ab12b8d8e70c13745becd72aefdd1d78a","target":"graph","created_at":"2026-05-18T00:24:26Z","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":"We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points and inducing the poset P on the non- minimal points. It turns out that these counting functions are closely related to a collection of downset numbers of certain subposets. Since any function of that kind is an exponential sum (with the number of minimal points as exponent), we call it the exponential function of the poset. Some linear equations, divisibilit","authors_text":"Frank a Campo, Marcel Ern\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-05T14:33:36Z","title":"Exponential functions of finite posets and the number of extensions with a fixed set of minimal points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01419","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:a5fe8769153c30dae447ce240878e8848587be44b0dfc817c715243ad9081ddc","target":"record","created_at":"2026-05-18T00:24:26Z","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":"8771cec90e5e1303f092e66178e1c141fe61aebac028258db0c30d3cab823c8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-05T14:33:36Z","title_canon_sha256":"bd1804e03257dd72a4be37f454327bd84e9fa8726871ccbb222b92743b086145"},"schema_version":"1.0","source":{"id":"1802.01419","kind":"arxiv","version":1}},"canonical_sha256":"6542839ff48812783f1b4d89cf9d4bb71a1579620c614b7aaabff0bf34b0e013","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6542839ff48812783f1b4d89cf9d4bb71a1579620c614b7aaabff0bf34b0e013","first_computed_at":"2026-05-18T00:24:26.438388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:26.438388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CGtsKWAUfWDR0/a+tnntOVtk3vn5feJFqxozVxE6KvThITR9l/4aKi0q4Yl5C+kgCyBoNbgdwZ2FhtT5d8PWBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:26.438865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5fe8769153c30dae447ce240878e8848587be44b0dfc817c715243ad9081ddc","sha256:2bdae94b800db0ca3c20ede4517eaa1ab12b8d8e70c13745becd72aefdd1d78a"],"state_sha256":"a326710eba8054c9fae8b2a23a2124b3e8fddd104547b0e318241810a78c354d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vKEx3+65J3zOz+852ZqwPNWu0+phl/GLUaH+yippxOu2/moxfMyZEIqMj5R7TmEyyO2chk0iykyfEkkRqKP4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:15:57.911466Z","bundle_sha256":"bdb6ab5e0e187a06d7c12685778750c7abf0314bdada33edc07cdcd9ddbfea10"}}