{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:B6WWOQEJTFAHZKRX7WFHGTIRUZ","short_pith_number":"pith:B6WWOQEJ","schema_version":"1.0","canonical_sha256":"0fad67408999407caa37fd8a734d11a65e5a67677d85df5eb9a7158e219dca18","source":{"kind":"arxiv","id":"1406.6517","version":1},"attestation_state":"computed","paper":{"title":"Homogeneous coloured multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deborah C Lockett, John K Truss","submitted_at":"2014-06-25T10:14:14Z","abstract_excerpt":"We classify the countable homogeneous coloured multipartite graphs with any finite number of parts. By Fraisse's Theorem this amounts to classifying the families F of pairwise non-embeddable finite coloured multipartite graphs for which the class Forb(F) of multipartite graphs which forbid these is an amalgamation class. We show that once we understand such families F in the quadripartite case, things do not become any more complicated for larger numbers of parts."},"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":"1406.6517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-25T10:14:14Z","cross_cats_sorted":[],"title_canon_sha256":"6e132c693bdd9f655f167fd078b48a2652a9c2f9b473c6613d12a9f14c3b107b","abstract_canon_sha256":"01591866e989cbd97e6882570de4264713f9a6c23af4241b3ba996becc27f925"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:02.686269Z","signature_b64":"lN1ONn73yMWiU5AB9yI+gkZvAaPmDe95sc0GSUDOJ8YTj1t3QS3ZjIEe3g6pLe2uI+1PwQxkDCVonXw38WfGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fad67408999407caa37fd8a734d11a65e5a67677d85df5eb9a7158e219dca18","last_reissued_at":"2026-05-18T02:49:02.685746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:02.685746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homogeneous coloured multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deborah C Lockett, John K Truss","submitted_at":"2014-06-25T10:14:14Z","abstract_excerpt":"We classify the countable homogeneous coloured multipartite graphs with any finite number of parts. By Fraisse's Theorem this amounts to classifying the families F of pairwise non-embeddable finite coloured multipartite graphs for which the class Forb(F) of multipartite graphs which forbid these is an amalgamation class. We show that once we understand such families F in the quadripartite case, things do not become any more complicated for larger numbers of parts."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6517","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":"1406.6517","created_at":"2026-05-18T02:49:02.685821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6517v1","created_at":"2026-05-18T02:49:02.685821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6517","created_at":"2026-05-18T02:49:02.685821+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6WWOQEJTFAH","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6WWOQEJTFAHZKRX","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6WWOQEJ","created_at":"2026-05-18T12:28:22.404517+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/B6WWOQEJTFAHZKRX7WFHGTIRUZ","json":"https://pith.science/pith/B6WWOQEJTFAHZKRX7WFHGTIRUZ.json","graph_json":"https://pith.science/api/pith-number/B6WWOQEJTFAHZKRX7WFHGTIRUZ/graph.json","events_json":"https://pith.science/api/pith-number/B6WWOQEJTFAHZKRX7WFHGTIRUZ/events.json","paper":"https://pith.science/paper/B6WWOQEJ"},"agent_actions":{"view_html":"https://pith.science/pith/B6WWOQEJTFAHZKRX7WFHGTIRUZ","download_json":"https://pith.science/pith/B6WWOQEJTFAHZKRX7WFHGTIRUZ.json","view_paper":"https://pith.science/paper/B6WWOQEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6517&json=true","fetch_graph":"https://pith.science/api/pith-number/B6WWOQEJTFAHZKRX7WFHGTIRUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/B6WWOQEJTFAHZKRX7WFHGTIRUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6WWOQEJTFAHZKRX7WFHGTIRUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6WWOQEJTFAHZKRX7WFHGTIRUZ/action/storage_attestation","attest_author":"https://pith.science/pith/B6WWOQEJTFAHZKRX7WFHGTIRUZ/action/author_attestation","sign_citation":"https://pith.science/pith/B6WWOQEJTFAHZKRX7WFHGTIRUZ/action/citation_signature","submit_replication":"https://pith.science/pith/B6WWOQEJTFAHZKRX7WFHGTIRUZ/action/replication_record"}},"created_at":"2026-05-18T02:49:02.685821+00:00","updated_at":"2026-05-18T02:49:02.685821+00:00"}