{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:Z5XOO6RK6EN422MBVC7XIKODDL","short_pith_number":"pith:Z5XOO6RK","schema_version":"1.0","canonical_sha256":"cf6ee77a2af11bcd6981a8bf7429c31adb6e78bd41f31dc2e67b3d17d59fca74","source":{"kind":"arxiv","id":"math/0702369","version":1},"attestation_state":"computed","paper":{"title":"Highly connected multicoloured subgraphs of multicoloured graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henry Liu, Noah Prince, Robert Morris","submitted_at":"2007-02-13T15:29:53Z","abstract_excerpt":"Suppose the edges of the complete graph on n vertices are coloured using r colours; how large a k-connected subgraph are we guaranteed to find, which uses only at most s of the colours? This question is due to Bollobas, and the case s = 1 was considered in a preivous paper by the same authors. Here we consider the case s >= 2, and mention some open problems."},"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":"math/0702369","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-02-13T15:29:53Z","cross_cats_sorted":[],"title_canon_sha256":"4b224824e3607dec4778eabcd1b910caa70b0086c937558e0d586dd5038287b8","abstract_canon_sha256":"7dc09d4bea03397fc5d6d9ae3e0ad88110bee1c053b3688cbae4811ac2bb01a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:59:31.180326Z","signature_b64":"OJeWe1LS+jMTWjT5yyXZTYeZQbyFm/kCRb2A+/y/9meCq6wzXALp+CWF4PfNeV1GmUReM2sNVi2Mzx9Hw+8aBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf6ee77a2af11bcd6981a8bf7429c31adb6e78bd41f31dc2e67b3d17d59fca74","last_reissued_at":"2026-07-04T14:59:31.179983Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:59:31.179983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Highly connected multicoloured subgraphs of multicoloured graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henry Liu, Noah Prince, Robert Morris","submitted_at":"2007-02-13T15:29:53Z","abstract_excerpt":"Suppose the edges of the complete graph on n vertices are coloured using r colours; how large a k-connected subgraph are we guaranteed to find, which uses only at most s of the colours? This question is due to Bollobas, and the case s = 1 was considered in a preivous paper by the same authors. Here we consider the case s >= 2, and mention some open problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0702369","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0702369/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0702369","created_at":"2026-07-04T14:59:31.180040+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0702369v1","created_at":"2026-07-04T14:59:31.180040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0702369","created_at":"2026-07-04T14:59:31.180040+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5XOO6RK6EN4","created_at":"2026-07-04T14:59:31.180040+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5XOO6RK6EN422MB","created_at":"2026-07-04T14:59:31.180040+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5XOO6RK","created_at":"2026-07-04T14:59:31.180040+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/Z5XOO6RK6EN422MBVC7XIKODDL","json":"https://pith.science/pith/Z5XOO6RK6EN422MBVC7XIKODDL.json","graph_json":"https://pith.science/api/pith-number/Z5XOO6RK6EN422MBVC7XIKODDL/graph.json","events_json":"https://pith.science/api/pith-number/Z5XOO6RK6EN422MBVC7XIKODDL/events.json","paper":"https://pith.science/paper/Z5XOO6RK"},"agent_actions":{"view_html":"https://pith.science/pith/Z5XOO6RK6EN422MBVC7XIKODDL","download_json":"https://pith.science/pith/Z5XOO6RK6EN422MBVC7XIKODDL.json","view_paper":"https://pith.science/paper/Z5XOO6RK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0702369&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5XOO6RK6EN422MBVC7XIKODDL/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5XOO6RK6EN422MBVC7XIKODDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5XOO6RK6EN422MBVC7XIKODDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5XOO6RK6EN422MBVC7XIKODDL/action/storage_attestation","attest_author":"https://pith.science/pith/Z5XOO6RK6EN422MBVC7XIKODDL/action/author_attestation","sign_citation":"https://pith.science/pith/Z5XOO6RK6EN422MBVC7XIKODDL/action/citation_signature","submit_replication":"https://pith.science/pith/Z5XOO6RK6EN422MBVC7XIKODDL/action/replication_record"}},"created_at":"2026-07-04T14:59:31.180040+00:00","updated_at":"2026-07-04T14:59:31.180040+00:00"}