{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4CTE5GYGX3KDC3FLXSJ27X3NAE","short_pith_number":"pith:4CTE5GYG","schema_version":"1.0","canonical_sha256":"e0a64e9b06bed4316cabbc93afdf6d010921e7165b5b1260a745d76afe5e11ee","source":{"kind":"arxiv","id":"1505.07161","version":1},"attestation_state":"computed","paper":{"title":"Presenting Finite Posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"\\'Ecole Polytechnique), Samuel Mimram (LIX","submitted_at":"2015-05-27T00:47:42Z","abstract_excerpt":"We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of generators and relations, we construct a presentation of our category, which corresponds to a variant of the notion of bialgebra."},"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":"1505.07161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-27T00:47:42Z","cross_cats_sorted":[],"title_canon_sha256":"582a1c87e16d408da33154196a1797ae00924d7cce9cb725f2f75fbecb69e584","abstract_canon_sha256":"415ab014a21c10d65c3fdfb12e59a0373e34ac063c87c1709ca193d027c0e2d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:07.328049Z","signature_b64":"f8/sWYmXoMQudzFpNX8nAP2AQn/iiYDmybe10x1GO47u7f/kzVY2EG/jzkWDBHF00xF5unriBakh+8jzjTB0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0a64e9b06bed4316cabbc93afdf6d010921e7165b5b1260a745d76afe5e11ee","last_reissued_at":"2026-05-18T02:02:07.327199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:07.327199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Presenting Finite Posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"\\'Ecole Polytechnique), Samuel Mimram (LIX","submitted_at":"2015-05-27T00:47:42Z","abstract_excerpt":"We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of generators and relations, we construct a presentation of our category, which corresponds to a variant of the notion of bialgebra."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07161","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":"1505.07161","created_at":"2026-05-18T02:02:07.327331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07161v1","created_at":"2026-05-18T02:02:07.327331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07161","created_at":"2026-05-18T02:02:07.327331+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CTE5GYGX3KD","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CTE5GYGX3KDC3FL","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CTE5GYG","created_at":"2026-05-18T12:29:05.191682+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/4CTE5GYGX3KDC3FLXSJ27X3NAE","json":"https://pith.science/pith/4CTE5GYGX3KDC3FLXSJ27X3NAE.json","graph_json":"https://pith.science/api/pith-number/4CTE5GYGX3KDC3FLXSJ27X3NAE/graph.json","events_json":"https://pith.science/api/pith-number/4CTE5GYGX3KDC3FLXSJ27X3NAE/events.json","paper":"https://pith.science/paper/4CTE5GYG"},"agent_actions":{"view_html":"https://pith.science/pith/4CTE5GYGX3KDC3FLXSJ27X3NAE","download_json":"https://pith.science/pith/4CTE5GYGX3KDC3FLXSJ27X3NAE.json","view_paper":"https://pith.science/paper/4CTE5GYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07161&json=true","fetch_graph":"https://pith.science/api/pith-number/4CTE5GYGX3KDC3FLXSJ27X3NAE/graph.json","fetch_events":"https://pith.science/api/pith-number/4CTE5GYGX3KDC3FLXSJ27X3NAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CTE5GYGX3KDC3FLXSJ27X3NAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CTE5GYGX3KDC3FLXSJ27X3NAE/action/storage_attestation","attest_author":"https://pith.science/pith/4CTE5GYGX3KDC3FLXSJ27X3NAE/action/author_attestation","sign_citation":"https://pith.science/pith/4CTE5GYGX3KDC3FLXSJ27X3NAE/action/citation_signature","submit_replication":"https://pith.science/pith/4CTE5GYGX3KDC3FLXSJ27X3NAE/action/replication_record"}},"created_at":"2026-05-18T02:02:07.327331+00:00","updated_at":"2026-05-18T02:02:07.327331+00:00"}