{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UO6MVS7OVHLJ657P2CZB2VKOPX","short_pith_number":"pith:UO6MVS7O","canonical_record":{"source":{"id":"1901.09363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-27T12:09:11Z","cross_cats_sorted":[],"title_canon_sha256":"76efbb7d38fef9a20e83e716ee878d942db4336e00dbd763c983c32693c9c7d9","abstract_canon_sha256":"9df769291829d04f8f3fb0505fa634add0e54b16bf2d88678010dafbb5dfc35a"},"schema_version":"1.0"},"canonical_sha256":"a3bccacbeea9d69f77efd0b21d554e7dd987071c146ef70f7eb10a1032da3884","source":{"kind":"arxiv","id":"1901.09363","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09363","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09363v1","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09363","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"UO6MVS7OVHLJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UO6MVS7OVHLJ657P","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UO6MVS7O","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UO6MVS7OVHLJ657P2CZB2VKOPX","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-27T12:09:11Z","cross_cats_sorted":[],"title_canon_sha256":"76efbb7d38fef9a20e83e716ee878d942db4336e00dbd763c983c32693c9c7d9","abstract_canon_sha256":"9df769291829d04f8f3fb0505fa634add0e54b16bf2d88678010dafbb5dfc35a"},"schema_version":"1.0"},"canonical_sha256":"a3bccacbeea9d69f77efd0b21d554e7dd987071c146ef70f7eb10a1032da3884","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:25.000819Z","signature_b64":"09teqGV4jStIHnQSNMRWhqrhtQKneSWSMadUGYWtFL0WMOHu1/fC9qSBeyjPnW5WUHJK+qXXmTSZeRgftUNBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3bccacbeea9d69f77efd0b21d554e7dd987071c146ef70f7eb10a1032da3884","last_reissued_at":"2026-05-17T23:55:25.000356Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:25.000356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09363","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-17T23:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCtWOppHoPoBeWo5i57gpVObGVmZ9BbS4b5ZJsyIGrF32KnwwvwPn1hMSWJFp4S18aolqNvAS65QECKIELHjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:35:21.737207Z"},"content_sha256":"dd626366984164f812bc79b6a73a99a8b7bd5017780b83057cb7d07ce5d250f8","schema_version":"1.0","event_id":"sha256:dd626366984164f812bc79b6a73a99a8b7bd5017780b83057cb7d07ce5d250f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UO6MVS7OVHLJ657P2CZB2VKOPX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hereditary classes of ordered binary structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Djamila Oudrar","submitted_at":"2019-01-27T12:09:11Z","abstract_excerpt":"Balogh, Bollob\\'{a}s and Morris (2006) have described a threshold phenomenon in the behavior of the profile of hereditary classes of ordered graphs. In this paper, we give an other look at their result based on the notion of monomorphic decomposition of a relational structure introduced in \\cite{P-T-2013}. We prove that the class $\\mathfrak S$ of ordered binary structures which do not have a finite monomorphic decomposition has a finite basis (a subset $\\mathfrak A$ such that every member of $\\mathfrak S$ embeds some member of $\\mathfrak A$). In the case of ordered reflexive directed graphs, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09363","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-17T23:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"be4HDzebtfDt0KD6O1XE3l/Jwl+mXXC+uZHWerQNQrxNhBWOJWq9nUPSGW8ys73C36V3OOCBdoJ5Ak9G5v8qDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:35:21.737913Z"},"content_sha256":"c0a1db137d957132e32cd9095c103a136da897b3e0d186ec49cb971077a1f703","schema_version":"1.0","event_id":"sha256:c0a1db137d957132e32cd9095c103a136da897b3e0d186ec49cb971077a1f703"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UO6MVS7OVHLJ657P2CZB2VKOPX/bundle.json","state_url":"https://pith.science/pith/UO6MVS7OVHLJ657P2CZB2VKOPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UO6MVS7OVHLJ657P2CZB2VKOPX/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-27T17:35:21Z","links":{"resolver":"https://pith.science/pith/UO6MVS7OVHLJ657P2CZB2VKOPX","bundle":"https://pith.science/pith/UO6MVS7OVHLJ657P2CZB2VKOPX/bundle.json","state":"https://pith.science/pith/UO6MVS7OVHLJ657P2CZB2VKOPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UO6MVS7OVHLJ657P2CZB2VKOPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UO6MVS7OVHLJ657P2CZB2VKOPX","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":"9df769291829d04f8f3fb0505fa634add0e54b16bf2d88678010dafbb5dfc35a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-27T12:09:11Z","title_canon_sha256":"76efbb7d38fef9a20e83e716ee878d942db4336e00dbd763c983c32693c9c7d9"},"schema_version":"1.0","source":{"id":"1901.09363","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09363","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09363v1","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09363","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"UO6MVS7OVHLJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UO6MVS7OVHLJ657P","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UO6MVS7O","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:c0a1db137d957132e32cd9095c103a136da897b3e0d186ec49cb971077a1f703","target":"graph","created_at":"2026-05-17T23:55:25Z","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":"Balogh, Bollob\\'{a}s and Morris (2006) have described a threshold phenomenon in the behavior of the profile of hereditary classes of ordered graphs. In this paper, we give an other look at their result based on the notion of monomorphic decomposition of a relational structure introduced in \\cite{P-T-2013}. We prove that the class $\\mathfrak S$ of ordered binary structures which do not have a finite monomorphic decomposition has a finite basis (a subset $\\mathfrak A$ such that every member of $\\mathfrak S$ embeds some member of $\\mathfrak A$). In the case of ordered reflexive directed graphs, t","authors_text":"Djamila Oudrar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-27T12:09:11Z","title":"Hereditary classes of ordered binary structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09363","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:dd626366984164f812bc79b6a73a99a8b7bd5017780b83057cb7d07ce5d250f8","target":"record","created_at":"2026-05-17T23:55:25Z","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":"9df769291829d04f8f3fb0505fa634add0e54b16bf2d88678010dafbb5dfc35a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-27T12:09:11Z","title_canon_sha256":"76efbb7d38fef9a20e83e716ee878d942db4336e00dbd763c983c32693c9c7d9"},"schema_version":"1.0","source":{"id":"1901.09363","kind":"arxiv","version":1}},"canonical_sha256":"a3bccacbeea9d69f77efd0b21d554e7dd987071c146ef70f7eb10a1032da3884","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3bccacbeea9d69f77efd0b21d554e7dd987071c146ef70f7eb10a1032da3884","first_computed_at":"2026-05-17T23:55:25.000356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:25.000356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"09teqGV4jStIHnQSNMRWhqrhtQKneSWSMadUGYWtFL0WMOHu1/fC9qSBeyjPnW5WUHJK+qXXmTSZeRgftUNBAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:25.000819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09363","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd626366984164f812bc79b6a73a99a8b7bd5017780b83057cb7d07ce5d250f8","sha256:c0a1db137d957132e32cd9095c103a136da897b3e0d186ec49cb971077a1f703"],"state_sha256":"f30eacec71b8bdec5ec5aa7ed315dd5606d4b74317a57295291c086458b28647"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXbErqAvrd+Xbg82egKa72Z0QKDdzi4LyIrbs15p4TgfP+0JIDjCbxDOZIWdn2EJVJ2InF9jaZrqNMy5iopbBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:35:21.741562Z","bundle_sha256":"5242c241f05b578ee9c4b3142768110b5b04729792f47a83a19be244e11705b0"}}