{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YDHDJGIV7YRTEZHQJWJ4L5XFGL","short_pith_number":"pith:YDHDJGIV","schema_version":"1.0","canonical_sha256":"c0ce349915fe233264f04d93c5f6e532c76489a8cdb14c89796235d342ad016f","source":{"kind":"arxiv","id":"1505.01616","version":2},"attestation_state":"computed","paper":{"title":"Colouring graphs with constraints on connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"D\\'aniel Marx, Fr\\'ed\\'eric Havet, Nick Brettell, Nicolas Trotignon, Pierre Aboulker","submitted_at":"2015-05-07T08:11:23Z","abstract_excerpt":"A graph $G$ has maximal local edge-connectivity $k$ if the maximum number of edge-disjoint paths between every pair of distinct vertices $x$ and $y$ is at most $k$. We prove Brooks-type theorems for $k$-connected graphs with maximal local edge-connectivity $k$, and for any graph with maximal local edge-connectivity 3. We also consider several related graph classes defined by constraints on connectivity. In particular, we show that there is a polynomial-time algorithm that, given a 3-connected graph $G$ with maximal local connectivity 3, outputs an optimal colouring for $G$. On the other hand, "},"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":"1505.01616","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-07T08:11:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d7d3493b987b4214ff77be9026d76c5f0e9c7d2a71144457156cc18f302f3416","abstract_canon_sha256":"055b3ffe0705cc5b4d3f0476a52a6ab39c0f6b6fc142292010da8dcfb5505fc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:01:53.528000Z","signature_b64":"ukI0F5p7D4H3HQj3WMsb6z4CyIs7wRoXU5ZKleeo2bZ3KOpyi+HgC2wuehZa+mjN3qzFZwpGcq2J0CXGETpYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0ce349915fe233264f04d93c5f6e532c76489a8cdb14c89796235d342ad016f","last_reissued_at":"2026-07-05T04:01:53.527510Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:01:53.527510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colouring graphs with constraints on connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"D\\'aniel Marx, Fr\\'ed\\'eric Havet, Nick Brettell, Nicolas Trotignon, Pierre Aboulker","submitted_at":"2015-05-07T08:11:23Z","abstract_excerpt":"A graph $G$ has maximal local edge-connectivity $k$ if the maximum number of edge-disjoint paths between every pair of distinct vertices $x$ and $y$ is at most $k$. We prove Brooks-type theorems for $k$-connected graphs with maximal local edge-connectivity $k$, and for any graph with maximal local edge-connectivity 3. We also consider several related graph classes defined by constraints on connectivity. In particular, we show that there is a polynomial-time algorithm that, given a 3-connected graph $G$ with maximal local connectivity 3, outputs an optimal colouring for $G$. On the other hand, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01616","kind":"arxiv","version":2},"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/1505.01616/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":"1505.01616","created_at":"2026-07-05T04:01:53.527569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01616v2","created_at":"2026-07-05T04:01:53.527569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01616","created_at":"2026-07-05T04:01:53.527569+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDHDJGIV7YRT","created_at":"2026-07-05T04:01:53.527569+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDHDJGIV7YRTEZHQ","created_at":"2026-07-05T04:01:53.527569+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDHDJGIV","created_at":"2026-07-05T04:01:53.527569+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/YDHDJGIV7YRTEZHQJWJ4L5XFGL","json":"https://pith.science/pith/YDHDJGIV7YRTEZHQJWJ4L5XFGL.json","graph_json":"https://pith.science/api/pith-number/YDHDJGIV7YRTEZHQJWJ4L5XFGL/graph.json","events_json":"https://pith.science/api/pith-number/YDHDJGIV7YRTEZHQJWJ4L5XFGL/events.json","paper":"https://pith.science/paper/YDHDJGIV"},"agent_actions":{"view_html":"https://pith.science/pith/YDHDJGIV7YRTEZHQJWJ4L5XFGL","download_json":"https://pith.science/pith/YDHDJGIV7YRTEZHQJWJ4L5XFGL.json","view_paper":"https://pith.science/paper/YDHDJGIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01616&json=true","fetch_graph":"https://pith.science/api/pith-number/YDHDJGIV7YRTEZHQJWJ4L5XFGL/graph.json","fetch_events":"https://pith.science/api/pith-number/YDHDJGIV7YRTEZHQJWJ4L5XFGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDHDJGIV7YRTEZHQJWJ4L5XFGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDHDJGIV7YRTEZHQJWJ4L5XFGL/action/storage_attestation","attest_author":"https://pith.science/pith/YDHDJGIV7YRTEZHQJWJ4L5XFGL/action/author_attestation","sign_citation":"https://pith.science/pith/YDHDJGIV7YRTEZHQJWJ4L5XFGL/action/citation_signature","submit_replication":"https://pith.science/pith/YDHDJGIV7YRTEZHQJWJ4L5XFGL/action/replication_record"}},"created_at":"2026-07-05T04:01:53.527569+00:00","updated_at":"2026-07-05T04:01:53.527569+00:00"}