{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NIESZNVF5TTQV6IKDWVN634P6Y","short_pith_number":"pith:NIESZNVF","schema_version":"1.0","canonical_sha256":"6a092cb6a5ece70af90a1daadf6f8ff62cefc06b99a22bf7261d8a945dfce327","source":{"kind":"arxiv","id":"1104.3919","version":1},"attestation_state":"computed","paper":{"title":"Some results on triangle partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sheung-Hung Poon, Ton Kloks","submitted_at":"2011-04-20T02:05:48Z","abstract_excerpt":"We show that there exist efficient algorithms for the triangle packing problem in colored permutation graphs, complete multipartite graphs, distance-hereditary graphs, k-modular permutation graphs and complements of k-partite graphs (when k is fixed). We show that there is an efficient algorithm for C_4-packing on bipartite permutation graphs and we show that C_4-packing on bipartite graphs is NP-complete. We characterize the cobipartite graphs that have a triangle partition."},"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":"1104.3919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-20T02:05:48Z","cross_cats_sorted":[],"title_canon_sha256":"1fcc0744e10859d1bfee287e657d5bc357b557513e9af4486e104488c5740e17","abstract_canon_sha256":"5996ab114f336ce449f25d52b9c28bb9bbd9b6b6fa6cbb525733454198a1b241"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:47.443997Z","signature_b64":"Rf4ouTzwTejo+gs0yYSVZLHbUlcB/Y2SaEMcLN6Jw3UUw0/k9ir2vPkqhgOM1ztP+9X4NreJoSFrQZGUjCbLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a092cb6a5ece70af90a1daadf6f8ff62cefc06b99a22bf7261d8a945dfce327","last_reissued_at":"2026-05-18T04:23:47.443237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:47.443237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some results on triangle partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sheung-Hung Poon, Ton Kloks","submitted_at":"2011-04-20T02:05:48Z","abstract_excerpt":"We show that there exist efficient algorithms for the triangle packing problem in colored permutation graphs, complete multipartite graphs, distance-hereditary graphs, k-modular permutation graphs and complements of k-partite graphs (when k is fixed). We show that there is an efficient algorithm for C_4-packing on bipartite permutation graphs and we show that C_4-packing on bipartite graphs is NP-complete. We characterize the cobipartite graphs that have a triangle partition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3919","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":"1104.3919","created_at":"2026-05-18T04:23:47.443359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3919v1","created_at":"2026-05-18T04:23:47.443359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3919","created_at":"2026-05-18T04:23:47.443359+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIESZNVF5TTQ","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIESZNVF5TTQV6IK","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIESZNVF","created_at":"2026-05-18T12:26:37.096874+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/NIESZNVF5TTQV6IKDWVN634P6Y","json":"https://pith.science/pith/NIESZNVF5TTQV6IKDWVN634P6Y.json","graph_json":"https://pith.science/api/pith-number/NIESZNVF5TTQV6IKDWVN634P6Y/graph.json","events_json":"https://pith.science/api/pith-number/NIESZNVF5TTQV6IKDWVN634P6Y/events.json","paper":"https://pith.science/paper/NIESZNVF"},"agent_actions":{"view_html":"https://pith.science/pith/NIESZNVF5TTQV6IKDWVN634P6Y","download_json":"https://pith.science/pith/NIESZNVF5TTQV6IKDWVN634P6Y.json","view_paper":"https://pith.science/paper/NIESZNVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3919&json=true","fetch_graph":"https://pith.science/api/pith-number/NIESZNVF5TTQV6IKDWVN634P6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/NIESZNVF5TTQV6IKDWVN634P6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIESZNVF5TTQV6IKDWVN634P6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIESZNVF5TTQV6IKDWVN634P6Y/action/storage_attestation","attest_author":"https://pith.science/pith/NIESZNVF5TTQV6IKDWVN634P6Y/action/author_attestation","sign_citation":"https://pith.science/pith/NIESZNVF5TTQV6IKDWVN634P6Y/action/citation_signature","submit_replication":"https://pith.science/pith/NIESZNVF5TTQV6IKDWVN634P6Y/action/replication_record"}},"created_at":"2026-05-18T04:23:47.443359+00:00","updated_at":"2026-05-18T04:23:47.443359+00:00"}