{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4J6K5KG3GJGW5RIDJO3EJCCK3A","short_pith_number":"pith:4J6K5KG3","schema_version":"1.0","canonical_sha256":"e27caea8db324d6ec5034bb644884ad82e9a93fade6948cca2ee2c179f472bd9","source":{"kind":"arxiv","id":"1810.03409","version":1},"attestation_state":"computed","paper":{"title":"On the Domination Number of Permutation Graphs and an Application to Strong Fixed Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel McGinnis, James Hammer, Joshua Harrington, Mia Friedberg, Michael Cory, Peter Gardner, Riley Waechter, Theresa Baren, Tony W.H. Wong","submitted_at":"2018-10-08T12:43:58Z","abstract_excerpt":"A permutation graph $G_\\pi$ is a simple graph with vertices corresponding to the elements of $\\pi$ and an edge between $i$ and $j$ when $i$ and $j$ are inverted in $\\pi$. A set of vertices $D$ is said to dominate a graph $G$ when every vertex in $G$ is either an element of $D$, or adjacent to an element of $D$. The domination number $\\gamma(G)$ is defined as the cardinality of a minimum dominating set of $G$. A strong fixed point of a permutation $\\pi$ of order $n$ is an element $k$ such that $\\pi^{-1}(j)<\\pi^{-1}(k)$ for all $j<k$, and $\\pi^{-1}(i)>\\pi^{-1}(k)$ for all $i>k$. In this article,"},"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":"1810.03409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-08T12:43:58Z","cross_cats_sorted":[],"title_canon_sha256":"1f0606c41f8297327963ff54082e4d45296578f33c678635b80338ecfee6520e","abstract_canon_sha256":"7cf60974a8cbd76a10f987f15d2255e7c330e92fe88865cd61f27138b797dee5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:40.392178Z","signature_b64":"hGShbvJWaN+xxmuLUEH/zRi56jBhbROaJ2/6qTJ30ib7eloTxL3IxgKZZOlB4RNvos/sjTLEk7yIhON8cgYqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e27caea8db324d6ec5034bb644884ad82e9a93fade6948cca2ee2c179f472bd9","last_reissued_at":"2026-07-05T01:39:40.391674Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:40.391674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Domination Number of Permutation Graphs and an Application to Strong Fixed Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel McGinnis, James Hammer, Joshua Harrington, Mia Friedberg, Michael Cory, Peter Gardner, Riley Waechter, Theresa Baren, Tony W.H. Wong","submitted_at":"2018-10-08T12:43:58Z","abstract_excerpt":"A permutation graph $G_\\pi$ is a simple graph with vertices corresponding to the elements of $\\pi$ and an edge between $i$ and $j$ when $i$ and $j$ are inverted in $\\pi$. A set of vertices $D$ is said to dominate a graph $G$ when every vertex in $G$ is either an element of $D$, or adjacent to an element of $D$. The domination number $\\gamma(G)$ is defined as the cardinality of a minimum dominating set of $G$. A strong fixed point of a permutation $\\pi$ of order $n$ is an element $k$ such that $\\pi^{-1}(j)<\\pi^{-1}(k)$ for all $j<k$, and $\\pi^{-1}(i)>\\pi^{-1}(k)$ for all $i>k$. In this article,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03409","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.03409/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":"1810.03409","created_at":"2026-07-05T01:39:40.391731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03409v1","created_at":"2026-07-05T01:39:40.391731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03409","created_at":"2026-07-05T01:39:40.391731+00:00"},{"alias_kind":"pith_short_12","alias_value":"4J6K5KG3GJGW","created_at":"2026-07-05T01:39:40.391731+00:00"},{"alias_kind":"pith_short_16","alias_value":"4J6K5KG3GJGW5RID","created_at":"2026-07-05T01:39:40.391731+00:00"},{"alias_kind":"pith_short_8","alias_value":"4J6K5KG3","created_at":"2026-07-05T01:39:40.391731+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/4J6K5KG3GJGW5RIDJO3EJCCK3A","json":"https://pith.science/pith/4J6K5KG3GJGW5RIDJO3EJCCK3A.json","graph_json":"https://pith.science/api/pith-number/4J6K5KG3GJGW5RIDJO3EJCCK3A/graph.json","events_json":"https://pith.science/api/pith-number/4J6K5KG3GJGW5RIDJO3EJCCK3A/events.json","paper":"https://pith.science/paper/4J6K5KG3"},"agent_actions":{"view_html":"https://pith.science/pith/4J6K5KG3GJGW5RIDJO3EJCCK3A","download_json":"https://pith.science/pith/4J6K5KG3GJGW5RIDJO3EJCCK3A.json","view_paper":"https://pith.science/paper/4J6K5KG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03409&json=true","fetch_graph":"https://pith.science/api/pith-number/4J6K5KG3GJGW5RIDJO3EJCCK3A/graph.json","fetch_events":"https://pith.science/api/pith-number/4J6K5KG3GJGW5RIDJO3EJCCK3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4J6K5KG3GJGW5RIDJO3EJCCK3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4J6K5KG3GJGW5RIDJO3EJCCK3A/action/storage_attestation","attest_author":"https://pith.science/pith/4J6K5KG3GJGW5RIDJO3EJCCK3A/action/author_attestation","sign_citation":"https://pith.science/pith/4J6K5KG3GJGW5RIDJO3EJCCK3A/action/citation_signature","submit_replication":"https://pith.science/pith/4J6K5KG3GJGW5RIDJO3EJCCK3A/action/replication_record"}},"created_at":"2026-07-05T01:39:40.391731+00:00","updated_at":"2026-07-05T01:39:40.391731+00:00"}