{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TAK337WC2AVMNE77VCEAAKXYCN","short_pith_number":"pith:TAK337WC","schema_version":"1.0","canonical_sha256":"9815bdfec2d02ac693ffa888002af81379467bfc55539084edb154798f1fac14","source":{"kind":"arxiv","id":"1603.04615","version":4},"attestation_state":"computed","paper":{"title":"Recent techniques and results on the Erd\\H{o}s-P\\'osa property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dimitrios M. Thilikos, Jean-Florent Raymond","submitted_at":"2016-03-15T09:58:15Z","abstract_excerpt":"Several min-max relations in graph theory can be expressed in the framework of the Erd\\H{o}s-P\\'osa property. Typically, this property reveals a connection between packing and covering problems on graphs. We describe some recent techniques for proving this property that are related to tree-like decompositions. We also provide an unified presentation of the current state of the art on this topic."},"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":"1603.04615","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-15T09:58:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f7c46917d9123dacac74b558292eb3053ff2aed50476682074b7ed4178a851f6","abstract_canon_sha256":"35af3c57b032ca431bf68cca16e76a8500fdc6ec5ad88813c0eb2fde56c9d850"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:14.062995Z","signature_b64":"GHTtymBFXJHr4rvXln8nvcTFvk31YuhNfK2wczfgUwqCH0cc1Ee15NAAFlh4xa7k2LdTipm7OvbudP0FEaaGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9815bdfec2d02ac693ffa888002af81379467bfc55539084edb154798f1fac14","last_reissued_at":"2026-05-18T00:55:14.062603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:14.062603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recent techniques and results on the Erd\\H{o}s-P\\'osa property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dimitrios M. Thilikos, Jean-Florent Raymond","submitted_at":"2016-03-15T09:58:15Z","abstract_excerpt":"Several min-max relations in graph theory can be expressed in the framework of the Erd\\H{o}s-P\\'osa property. Typically, this property reveals a connection between packing and covering problems on graphs. We describe some recent techniques for proving this property that are related to tree-like decompositions. We also provide an unified presentation of the current state of the art on this topic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04615","kind":"arxiv","version":4},"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":"1603.04615","created_at":"2026-05-18T00:55:14.062663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04615v4","created_at":"2026-05-18T00:55:14.062663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04615","created_at":"2026-05-18T00:55:14.062663+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAK337WC2AVM","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAK337WC2AVMNE77","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAK337WC","created_at":"2026-05-18T12:30:44.179134+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/TAK337WC2AVMNE77VCEAAKXYCN","json":"https://pith.science/pith/TAK337WC2AVMNE77VCEAAKXYCN.json","graph_json":"https://pith.science/api/pith-number/TAK337WC2AVMNE77VCEAAKXYCN/graph.json","events_json":"https://pith.science/api/pith-number/TAK337WC2AVMNE77VCEAAKXYCN/events.json","paper":"https://pith.science/paper/TAK337WC"},"agent_actions":{"view_html":"https://pith.science/pith/TAK337WC2AVMNE77VCEAAKXYCN","download_json":"https://pith.science/pith/TAK337WC2AVMNE77VCEAAKXYCN.json","view_paper":"https://pith.science/paper/TAK337WC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04615&json=true","fetch_graph":"https://pith.science/api/pith-number/TAK337WC2AVMNE77VCEAAKXYCN/graph.json","fetch_events":"https://pith.science/api/pith-number/TAK337WC2AVMNE77VCEAAKXYCN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAK337WC2AVMNE77VCEAAKXYCN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAK337WC2AVMNE77VCEAAKXYCN/action/storage_attestation","attest_author":"https://pith.science/pith/TAK337WC2AVMNE77VCEAAKXYCN/action/author_attestation","sign_citation":"https://pith.science/pith/TAK337WC2AVMNE77VCEAAKXYCN/action/citation_signature","submit_replication":"https://pith.science/pith/TAK337WC2AVMNE77VCEAAKXYCN/action/replication_record"}},"created_at":"2026-05-18T00:55:14.062663+00:00","updated_at":"2026-05-18T00:55:14.062663+00:00"}