{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UPMQ7PD7RAKYFSLR5BG5ZTM4RZ","short_pith_number":"pith:UPMQ7PD7","schema_version":"1.0","canonical_sha256":"a3d90fbc7f881582c971e84ddccd9c8e7c103d4bd0f2810864d51a49981010ee","source":{"kind":"arxiv","id":"1411.1749","version":2},"attestation_state":"computed","paper":{"title":"Frustrated Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabor Meszaros, Teeradej Kittipassorn","submitted_at":"2014-11-06T20:58:35Z","abstract_excerpt":"A triple of vertices in a graph is a \\emph{frustrated triangle} if it induces an odd number of edges. We study the set $F_n\\subset[0,\\binom{n}{3}]$ of possible number of frustrated triangles $f(G)$ in a graph $G$ on $n$ vertices. We prove that about two thirds of the numbers in $[0,n^{3/2}]$ cannot appear in $F_n$, and we characterise the graphs $G$ with $f(G)\\in[0,n^{3/2}]$. More precisely, our main result is that, for each $n\\geq 3$, $F_n$ contains two interlacing sequences $0=a_0\\leq b_0\\leq a_1\\leq b_1\\leq \\dots \\leq a_m\\leq b_m\\sim n^{3/2}$ such that $F_n\\cap(b_t,a_{t+1})=\\emptyset$ for a"},"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":"1411.1749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-06T20:58:35Z","cross_cats_sorted":[],"title_canon_sha256":"d4c2bdb280f37a40effc96a6dcbe2bacd8cd90cfa75985f2740836d44348e68b","abstract_canon_sha256":"87ab3d8fea6e839963f9ca4b182f19a055e52ae3d93e9e3fc22794b6edf4bdc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:16.551274Z","signature_b64":"jgcZ/ppc9rmUhfnagynXFyZMscwkHhMVmY3tSYaU0xgjks2gdjZEQkFq+ur4D4XeVU3hyKZ5O9xGfAq5UIGZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3d90fbc7f881582c971e84ddccd9c8e7c103d4bd0f2810864d51a49981010ee","last_reissued_at":"2026-05-18T02:19:16.550619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:16.550619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frustrated Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabor Meszaros, Teeradej Kittipassorn","submitted_at":"2014-11-06T20:58:35Z","abstract_excerpt":"A triple of vertices in a graph is a \\emph{frustrated triangle} if it induces an odd number of edges. We study the set $F_n\\subset[0,\\binom{n}{3}]$ of possible number of frustrated triangles $f(G)$ in a graph $G$ on $n$ vertices. We prove that about two thirds of the numbers in $[0,n^{3/2}]$ cannot appear in $F_n$, and we characterise the graphs $G$ with $f(G)\\in[0,n^{3/2}]$. More precisely, our main result is that, for each $n\\geq 3$, $F_n$ contains two interlacing sequences $0=a_0\\leq b_0\\leq a_1\\leq b_1\\leq \\dots \\leq a_m\\leq b_m\\sim n^{3/2}$ such that $F_n\\cap(b_t,a_{t+1})=\\emptyset$ for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1749","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":"1411.1749","created_at":"2026-05-18T02:19:16.550714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1749v2","created_at":"2026-05-18T02:19:16.550714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1749","created_at":"2026-05-18T02:19:16.550714+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPMQ7PD7RAKY","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPMQ7PD7RAKYFSLR","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPMQ7PD7","created_at":"2026-05-18T12:28:52.271510+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/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ","json":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ.json","graph_json":"https://pith.science/api/pith-number/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/graph.json","events_json":"https://pith.science/api/pith-number/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/events.json","paper":"https://pith.science/paper/UPMQ7PD7"},"agent_actions":{"view_html":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ","download_json":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ.json","view_paper":"https://pith.science/paper/UPMQ7PD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1749&json=true","fetch_graph":"https://pith.science/api/pith-number/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/action/storage_attestation","attest_author":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/action/author_attestation","sign_citation":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/action/citation_signature","submit_replication":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/action/replication_record"}},"created_at":"2026-05-18T02:19:16.550714+00:00","updated_at":"2026-05-18T02:19:16.550714+00:00"}