{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PET3UTEB3JDLT53LFHLCMWIJSB","short_pith_number":"pith:PET3UTEB","schema_version":"1.0","canonical_sha256":"7927ba4c81da46b9f76b29d626590990518dbbee69ae4a6849745528bb7fc0e5","source":{"kind":"arxiv","id":"1304.2215","version":1},"attestation_state":"computed","paper":{"title":"Adjoint functors in graph theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CT"],"primary_cat":"math.CO","authors_text":"Claude Tardif, Jan Foniok","submitted_at":"2013-04-08T14:21:43Z","abstract_excerpt":"We survey some uses of adjoint functors in graph theory pertaining to colourings, complexity reductions, multiplicativity, circular colourings and tree duality. The exposition of these applications through adjoint functors unifies the presentation to some extent, and also raises interesting questions."},"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":"1304.2215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-08T14:21:43Z","cross_cats_sorted":["cs.DM","math.CT"],"title_canon_sha256":"c23389803eb9cf3b98b426b89842738da55a0a5c3a0c0cd4995a81ef5304d15c","abstract_canon_sha256":"cbc31543e9d9b543be27b2f571e03514652018ad6f0506931a20f620d5a70720"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:43.696479Z","signature_b64":"EgkYdAeljsVyDB21Onplg5QSi8+D8nW4kDszFq5mKSPJteHd/p6C2LYHLnJRvb21iJSzEHOQO9ZeMHzVOi5+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7927ba4c81da46b9f76b29d626590990518dbbee69ae4a6849745528bb7fc0e5","last_reissued_at":"2026-05-18T03:28:43.695683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:43.695683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adjoint functors in graph theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CT"],"primary_cat":"math.CO","authors_text":"Claude Tardif, Jan Foniok","submitted_at":"2013-04-08T14:21:43Z","abstract_excerpt":"We survey some uses of adjoint functors in graph theory pertaining to colourings, complexity reductions, multiplicativity, circular colourings and tree duality. The exposition of these applications through adjoint functors unifies the presentation to some extent, and also raises interesting questions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2215","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":"1304.2215","created_at":"2026-05-18T03:28:43.695812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2215v1","created_at":"2026-05-18T03:28:43.695812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2215","created_at":"2026-05-18T03:28:43.695812+00:00"},{"alias_kind":"pith_short_12","alias_value":"PET3UTEB3JDL","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PET3UTEB3JDLT53L","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PET3UTEB","created_at":"2026-05-18T12:27:54.935989+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/PET3UTEB3JDLT53LFHLCMWIJSB","json":"https://pith.science/pith/PET3UTEB3JDLT53LFHLCMWIJSB.json","graph_json":"https://pith.science/api/pith-number/PET3UTEB3JDLT53LFHLCMWIJSB/graph.json","events_json":"https://pith.science/api/pith-number/PET3UTEB3JDLT53LFHLCMWIJSB/events.json","paper":"https://pith.science/paper/PET3UTEB"},"agent_actions":{"view_html":"https://pith.science/pith/PET3UTEB3JDLT53LFHLCMWIJSB","download_json":"https://pith.science/pith/PET3UTEB3JDLT53LFHLCMWIJSB.json","view_paper":"https://pith.science/paper/PET3UTEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2215&json=true","fetch_graph":"https://pith.science/api/pith-number/PET3UTEB3JDLT53LFHLCMWIJSB/graph.json","fetch_events":"https://pith.science/api/pith-number/PET3UTEB3JDLT53LFHLCMWIJSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PET3UTEB3JDLT53LFHLCMWIJSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PET3UTEB3JDLT53LFHLCMWIJSB/action/storage_attestation","attest_author":"https://pith.science/pith/PET3UTEB3JDLT53LFHLCMWIJSB/action/author_attestation","sign_citation":"https://pith.science/pith/PET3UTEB3JDLT53LFHLCMWIJSB/action/citation_signature","submit_replication":"https://pith.science/pith/PET3UTEB3JDLT53LFHLCMWIJSB/action/replication_record"}},"created_at":"2026-05-18T03:28:43.695812+00:00","updated_at":"2026-05-18T03:28:43.695812+00:00"}