{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HNHZKJ3NNWYN3MHMY4TBVHYEDA","short_pith_number":"pith:HNHZKJ3N","schema_version":"1.0","canonical_sha256":"3b4f95276d6db0ddb0ecc7261a9f0418009353f0bae96e80a95b87a44894fada","source":{"kind":"arxiv","id":"1407.2336","version":3},"attestation_state":"computed","paper":{"title":"Favaron's Theorem, k-dependence, and Tuza's Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo","submitted_at":"2014-07-09T02:11:59Z","abstract_excerpt":"A vertex set $D$ in a graph $G$ is $k$-dependent if $G[D]$ has maximum degree at most $k-1$, and $k$-dominating if every vertex outside $D$ has at least $k$ neighbors in $D$. Favaron proved that if $D$ is a $k$-dependent set maximizing the quantity $k|D| - |E(G[D])|$, then $D$ is $k$-dominating. We extend this result, showing that such sets satisfy a stronger structural property, and we find a surprising connection between Favaron's theorem and a conjecture of Tuza regarding packing and covering of triangles."},"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":"1407.2336","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-09T02:11:59Z","cross_cats_sorted":[],"title_canon_sha256":"ee84f88931b531152e44112087eeef9580bbaff9bb6c3e492f2251963fe78c88","abstract_canon_sha256":"c527207434d61a2f69b71a70e94006505713dc45cf12e305c71caec8d2df50cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:27.119157Z","signature_b64":"yRCqsn/TKeg7vgLDoZZyNBhxYiUn7Snh9m9HLqCTy6/y3ydXyHfG2mOro80tYVrT10CoHhLVFUMK5pHQMxI1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b4f95276d6db0ddb0ecc7261a9f0418009353f0bae96e80a95b87a44894fada","last_reissued_at":"2026-05-18T01:35:27.118531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:27.118531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Favaron's Theorem, k-dependence, and Tuza's Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo","submitted_at":"2014-07-09T02:11:59Z","abstract_excerpt":"A vertex set $D$ in a graph $G$ is $k$-dependent if $G[D]$ has maximum degree at most $k-1$, and $k$-dominating if every vertex outside $D$ has at least $k$ neighbors in $D$. Favaron proved that if $D$ is a $k$-dependent set maximizing the quantity $k|D| - |E(G[D])|$, then $D$ is $k$-dominating. We extend this result, showing that such sets satisfy a stronger structural property, and we find a surprising connection between Favaron's theorem and a conjecture of Tuza regarding packing and covering of triangles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2336","kind":"arxiv","version":3},"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":"1407.2336","created_at":"2026-05-18T01:35:27.118618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2336v3","created_at":"2026-05-18T01:35:27.118618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2336","created_at":"2026-05-18T01:35:27.118618+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNHZKJ3NNWYN","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNHZKJ3NNWYN3MHM","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNHZKJ3N","created_at":"2026-05-18T12:28:30.664211+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/HNHZKJ3NNWYN3MHMY4TBVHYEDA","json":"https://pith.science/pith/HNHZKJ3NNWYN3MHMY4TBVHYEDA.json","graph_json":"https://pith.science/api/pith-number/HNHZKJ3NNWYN3MHMY4TBVHYEDA/graph.json","events_json":"https://pith.science/api/pith-number/HNHZKJ3NNWYN3MHMY4TBVHYEDA/events.json","paper":"https://pith.science/paper/HNHZKJ3N"},"agent_actions":{"view_html":"https://pith.science/pith/HNHZKJ3NNWYN3MHMY4TBVHYEDA","download_json":"https://pith.science/pith/HNHZKJ3NNWYN3MHMY4TBVHYEDA.json","view_paper":"https://pith.science/paper/HNHZKJ3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2336&json=true","fetch_graph":"https://pith.science/api/pith-number/HNHZKJ3NNWYN3MHMY4TBVHYEDA/graph.json","fetch_events":"https://pith.science/api/pith-number/HNHZKJ3NNWYN3MHMY4TBVHYEDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNHZKJ3NNWYN3MHMY4TBVHYEDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNHZKJ3NNWYN3MHMY4TBVHYEDA/action/storage_attestation","attest_author":"https://pith.science/pith/HNHZKJ3NNWYN3MHMY4TBVHYEDA/action/author_attestation","sign_citation":"https://pith.science/pith/HNHZKJ3NNWYN3MHMY4TBVHYEDA/action/citation_signature","submit_replication":"https://pith.science/pith/HNHZKJ3NNWYN3MHMY4TBVHYEDA/action/replication_record"}},"created_at":"2026-05-18T01:35:27.118618+00:00","updated_at":"2026-05-18T01:35:27.118618+00:00"}