{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6RGQSMFA2TNWC5IE4HDRG5ZQQF","short_pith_number":"pith:6RGQSMFA","schema_version":"1.0","canonical_sha256":"f44d0930a0d4db617504e1c71377308146f88fc2695c39fd9b6b2020d706a2e6","source":{"kind":"arxiv","id":"1309.2165","version":3},"attestation_state":"computed","paper":{"title":"The 42 reducts of the random ordered graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Andr\\'as Pongr\\'acz, Manuel Bodirsky, Michael Pinsker","submitted_at":"2013-09-09T14:12:46Z","abstract_excerpt":"The random ordered graph is the up to isomorphism unique countable homogeneous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability."},"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":"1309.2165","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-09-09T14:12:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"88e56cdf111d1d6d000303100ad25d19b2fa9300e8581211fb97d4e8fce78860","abstract_canon_sha256":"d9ec173045b2712b091a7f8137a9672eb0f4833b7c9d992c1ce0a7e60c79b508"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:29.541342Z","signature_b64":"YwmVpS2rnqyJqF47cs7XDn5t5mU/WeIRAwjOQkkgwkuQJPxVHNn/VYR5l/UHmxK+/FlcKyPylnmv50cmB/bZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f44d0930a0d4db617504e1c71377308146f88fc2695c39fd9b6b2020d706a2e6","last_reissued_at":"2026-05-18T00:44:29.540877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:29.540877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The 42 reducts of the random ordered graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Andr\\'as Pongr\\'acz, Manuel Bodirsky, Michael Pinsker","submitted_at":"2013-09-09T14:12:46Z","abstract_excerpt":"The random ordered graph is the up to isomorphism unique countable homogeneous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2165","kind":"arxiv","version":3},"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":"1309.2165","created_at":"2026-05-18T00:44:29.540939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2165v3","created_at":"2026-05-18T00:44:29.540939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2165","created_at":"2026-05-18T00:44:29.540939+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RGQSMFA2TNW","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RGQSMFA2TNWC5IE","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RGQSMFA","created_at":"2026-05-18T12:27:36.564083+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/6RGQSMFA2TNWC5IE4HDRG5ZQQF","json":"https://pith.science/pith/6RGQSMFA2TNWC5IE4HDRG5ZQQF.json","graph_json":"https://pith.science/api/pith-number/6RGQSMFA2TNWC5IE4HDRG5ZQQF/graph.json","events_json":"https://pith.science/api/pith-number/6RGQSMFA2TNWC5IE4HDRG5ZQQF/events.json","paper":"https://pith.science/paper/6RGQSMFA"},"agent_actions":{"view_html":"https://pith.science/pith/6RGQSMFA2TNWC5IE4HDRG5ZQQF","download_json":"https://pith.science/pith/6RGQSMFA2TNWC5IE4HDRG5ZQQF.json","view_paper":"https://pith.science/paper/6RGQSMFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2165&json=true","fetch_graph":"https://pith.science/api/pith-number/6RGQSMFA2TNWC5IE4HDRG5ZQQF/graph.json","fetch_events":"https://pith.science/api/pith-number/6RGQSMFA2TNWC5IE4HDRG5ZQQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RGQSMFA2TNWC5IE4HDRG5ZQQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RGQSMFA2TNWC5IE4HDRG5ZQQF/action/storage_attestation","attest_author":"https://pith.science/pith/6RGQSMFA2TNWC5IE4HDRG5ZQQF/action/author_attestation","sign_citation":"https://pith.science/pith/6RGQSMFA2TNWC5IE4HDRG5ZQQF/action/citation_signature","submit_replication":"https://pith.science/pith/6RGQSMFA2TNWC5IE4HDRG5ZQQF/action/replication_record"}},"created_at":"2026-05-18T00:44:29.540939+00:00","updated_at":"2026-05-18T00:44:29.540939+00:00"}