{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:ODVPCDMP4DAJ5IAIEY4KPUKE57","short_pith_number":"pith:ODVPCDMP","schema_version":"1.0","canonical_sha256":"70eaf10d8fe0c09ea0082638a7d144efd6a3eaac3236c7212637bac4a6c558f5","source":{"kind":"arxiv","id":"0706.3121","version":2},"attestation_state":"computed","paper":{"title":"Multi-triangulations as complexes of star polygons","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Francisco Santos, Vincent Pilaud","submitted_at":"2007-06-21T10:46:49Z","abstract_excerpt":"Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them.\n  We introduce a new way of looking at $k$-triangulations, namely as complexes of star polygons. With this tool we give new, direct, proofs of the fundamental properties of $k$-triangulations, as well as some new results. This interpretation also opens-up new avenues of research, that we briefly explore in the last section."},"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":"0706.3121","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-06-21T10:46:49Z","cross_cats_sorted":[],"title_canon_sha256":"26fe61ee4f17e9264b054867bb087c97a6e3675228cab362b3d71cc35f661047","abstract_canon_sha256":"ca5790b99e3bc2189ca3487670425260874f5e4605d0ff3d466d710b3d765687"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:43.999000Z","signature_b64":"j8Elv2Nr7wSXb5BOIi0Cq8c6bhd4/cvmp8V+Of/3yWeKIe61vV+/oKotP9TqzwJGhSelZoGQIWEVRmFQrUg1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70eaf10d8fe0c09ea0082638a7d144efd6a3eaac3236c7212637bac4a6c558f5","last_reissued_at":"2026-05-18T03:53:43.998205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:43.998205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-triangulations as complexes of star polygons","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Francisco Santos, Vincent Pilaud","submitted_at":"2007-06-21T10:46:49Z","abstract_excerpt":"Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them.\n  We introduce a new way of looking at $k$-triangulations, namely as complexes of star polygons. With this tool we give new, direct, proofs of the fundamental properties of $k$-triangulations, as well as some new results. This interpretation also opens-up new avenues of research, that we briefly explore in the last section."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.3121","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":""},"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":"0706.3121","created_at":"2026-05-18T03:53:43.998337+00:00"},{"alias_kind":"arxiv_version","alias_value":"0706.3121v2","created_at":"2026-05-18T03:53:43.998337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.3121","created_at":"2026-05-18T03:53:43.998337+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODVPCDMP4DAJ","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODVPCDMP4DAJ5IAI","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODVPCDMP","created_at":"2026-05-18T12:25:55.427421+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/ODVPCDMP4DAJ5IAIEY4KPUKE57","json":"https://pith.science/pith/ODVPCDMP4DAJ5IAIEY4KPUKE57.json","graph_json":"https://pith.science/api/pith-number/ODVPCDMP4DAJ5IAIEY4KPUKE57/graph.json","events_json":"https://pith.science/api/pith-number/ODVPCDMP4DAJ5IAIEY4KPUKE57/events.json","paper":"https://pith.science/paper/ODVPCDMP"},"agent_actions":{"view_html":"https://pith.science/pith/ODVPCDMP4DAJ5IAIEY4KPUKE57","download_json":"https://pith.science/pith/ODVPCDMP4DAJ5IAIEY4KPUKE57.json","view_paper":"https://pith.science/paper/ODVPCDMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0706.3121&json=true","fetch_graph":"https://pith.science/api/pith-number/ODVPCDMP4DAJ5IAIEY4KPUKE57/graph.json","fetch_events":"https://pith.science/api/pith-number/ODVPCDMP4DAJ5IAIEY4KPUKE57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODVPCDMP4DAJ5IAIEY4KPUKE57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODVPCDMP4DAJ5IAIEY4KPUKE57/action/storage_attestation","attest_author":"https://pith.science/pith/ODVPCDMP4DAJ5IAIEY4KPUKE57/action/author_attestation","sign_citation":"https://pith.science/pith/ODVPCDMP4DAJ5IAIEY4KPUKE57/action/citation_signature","submit_replication":"https://pith.science/pith/ODVPCDMP4DAJ5IAIEY4KPUKE57/action/replication_record"}},"created_at":"2026-05-18T03:53:43.998337+00:00","updated_at":"2026-05-18T03:53:43.998337+00:00"}