{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QJYFQ3VHGT5PYBN3OPJYRO4QAB","short_pith_number":"pith:QJYFQ3VH","canonical_record":{"source":{"id":"1806.07871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-06-20T17:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"ecd658efeda7097af2c8306fb6cdd6085b90d1b7e7a3e41655feb74842c9b9e6","abstract_canon_sha256":"82de02fe5292c89a451691014c852ed1f7cf45dc938af220f9a64a937137a9cf"},"schema_version":"1.0"},"canonical_sha256":"8270586ea734fafc05bb73d388bb9000598bd425222f7809e27b47dade995692","source":{"kind":"arxiv","id":"1806.07871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07871","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07871v1","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07871","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"pith_short_12","alias_value":"QJYFQ3VHGT5P","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QJYFQ3VHGT5PYBN3","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QJYFQ3VH","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QJYFQ3VHGT5PYBN3OPJYRO4QAB","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-06-20T17:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"ecd658efeda7097af2c8306fb6cdd6085b90d1b7e7a3e41655feb74842c9b9e6","abstract_canon_sha256":"82de02fe5292c89a451691014c852ed1f7cf45dc938af220f9a64a937137a9cf"},"schema_version":"1.0"},"canonical_sha256":"8270586ea734fafc05bb73d388bb9000598bd425222f7809e27b47dade995692","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:46.392092Z","signature_b64":"PSU9JQUQTZ+Sx+Cg8NAu6KCjLUTW+9XONtMTWh0ETi067cNfzbeBnIshSjkQyJR9QAvozE+RIdvFtYLHd6QcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8270586ea734fafc05bb73d388bb9000598bd425222f7809e27b47dade995692","last_reissued_at":"2026-05-18T00:12:46.391449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:46.391449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07871","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:12:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1MiRXV7KDd4rwJR022Qk9N6m0nDPgW8Mr72C/+fQX5+jhMn/wUlTBmdvZqyn8PFfvPiJVd7ZZz3obeLmtUKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:40:57.342694Z"},"content_sha256":"e01db97f3fc077920a4c0aef31edd69ec633bb6b5ca5c3b0de4114384255a77c","schema_version":"1.0","event_id":"sha256:e01db97f3fc077920a4c0aef31edd69ec633bb6b5ca5c3b0de4114384255a77c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QJYFQ3VHGT5PYBN3OPJYRO4QAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Definability in the embeddability ordering of finite directed graphs, II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"\\'Ad\\'am Kunos","submitted_at":"2018-06-20T17:57:40Z","abstract_excerpt":"We deal with first-order definability in the embeddability ordering $( \\mathcal{D}; \\leq)$ of finite directed graphs. A directed graph $G\\in \\mathcal{D}$ is said to be embeddable into $G' \\in \\mathcal{D}$ if there exists an injective graph homomorphism $\\varphi \\colon G \\to G'$. We describe the first-order definable relations of $( \\mathcal{D}; \\leq)$ using the first-order language of an enriched small category of digraphs. The description yields the main result of one of the author's papers as a corollary and a lot more. For example, the set of weakly connected digraphs turns out to be first-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07871","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:12:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+XoY3LRPTBqeLyU+Ynl0nIP0Wo86QYLWQpRQMXtg09dhpFl/lxFQ0mlJdz+z3bU3CCbgfc6R6nmmHERW2dMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:40:57.343041Z"},"content_sha256":"9f21d92826ebdce948d0e78d27c5392f81665ba41bf15019e95dfc9f00431fa1","schema_version":"1.0","event_id":"sha256:9f21d92826ebdce948d0e78d27c5392f81665ba41bf15019e95dfc9f00431fa1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJYFQ3VHGT5PYBN3OPJYRO4QAB/bundle.json","state_url":"https://pith.science/pith/QJYFQ3VHGT5PYBN3OPJYRO4QAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJYFQ3VHGT5PYBN3OPJYRO4QAB/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-07-01T12:40:57Z","links":{"resolver":"https://pith.science/pith/QJYFQ3VHGT5PYBN3OPJYRO4QAB","bundle":"https://pith.science/pith/QJYFQ3VHGT5PYBN3OPJYRO4QAB/bundle.json","state":"https://pith.science/pith/QJYFQ3VHGT5PYBN3OPJYRO4QAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJYFQ3VHGT5PYBN3OPJYRO4QAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QJYFQ3VHGT5PYBN3OPJYRO4QAB","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":"82de02fe5292c89a451691014c852ed1f7cf45dc938af220f9a64a937137a9cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-06-20T17:57:40Z","title_canon_sha256":"ecd658efeda7097af2c8306fb6cdd6085b90d1b7e7a3e41655feb74842c9b9e6"},"schema_version":"1.0","source":{"id":"1806.07871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07871","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07871v1","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07871","created_at":"2026-05-18T00:12:46Z"},{"alias_kind":"pith_short_12","alias_value":"QJYFQ3VHGT5P","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QJYFQ3VHGT5PYBN3","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QJYFQ3VH","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:9f21d92826ebdce948d0e78d27c5392f81665ba41bf15019e95dfc9f00431fa1","target":"graph","created_at":"2026-05-18T00:12:46Z","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 deal with first-order definability in the embeddability ordering $( \\mathcal{D}; \\leq)$ of finite directed graphs. A directed graph $G\\in \\mathcal{D}$ is said to be embeddable into $G' \\in \\mathcal{D}$ if there exists an injective graph homomorphism $\\varphi \\colon G \\to G'$. We describe the first-order definable relations of $( \\mathcal{D}; \\leq)$ using the first-order language of an enriched small category of digraphs. The description yields the main result of one of the author's papers as a corollary and a lot more. For example, the set of weakly connected digraphs turns out to be first-","authors_text":"\\'Ad\\'am Kunos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-06-20T17:57:40Z","title":"Definability in the embeddability ordering of finite directed graphs, II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07871","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:e01db97f3fc077920a4c0aef31edd69ec633bb6b5ca5c3b0de4114384255a77c","target":"record","created_at":"2026-05-18T00:12:46Z","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":"82de02fe5292c89a451691014c852ed1f7cf45dc938af220f9a64a937137a9cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-06-20T17:57:40Z","title_canon_sha256":"ecd658efeda7097af2c8306fb6cdd6085b90d1b7e7a3e41655feb74842c9b9e6"},"schema_version":"1.0","source":{"id":"1806.07871","kind":"arxiv","version":1}},"canonical_sha256":"8270586ea734fafc05bb73d388bb9000598bd425222f7809e27b47dade995692","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8270586ea734fafc05bb73d388bb9000598bd425222f7809e27b47dade995692","first_computed_at":"2026-05-18T00:12:46.391449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:46.391449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PSU9JQUQTZ+Sx+Cg8NAu6KCjLUTW+9XONtMTWh0ETi067cNfzbeBnIshSjkQyJR9QAvozE+RIdvFtYLHd6QcAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:46.392092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e01db97f3fc077920a4c0aef31edd69ec633bb6b5ca5c3b0de4114384255a77c","sha256:9f21d92826ebdce948d0e78d27c5392f81665ba41bf15019e95dfc9f00431fa1"],"state_sha256":"e4832d2df2c4c70c6c10b005ad93377460dddf82ce4a642c0dcb27ad5acd50c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jxn2ijVhHUffIhuguS2O4a7Ij/7jMw9uhLOH01Mve27EczefFy8tqjKxjmqW4Or47ZXyQQSnpFRuk7ck1OgvBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T12:40:57.345189Z","bundle_sha256":"68d676c2a8f842f251dc2f7c17860ba1e9f6e26565c59d053d5d4960e4bbd4a7"}}