{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UPMQ7PD7RAKYFSLR5BG5ZTM4RZ","short_pith_number":"pith:UPMQ7PD7","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"},"canonical_sha256":"a3d90fbc7f881582c971e84ddccd9c8e7c103d4bd0f2810864d51a49981010ee","source":{"kind":"arxiv","id":"1411.1749","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1749","created_at":"2026-05-18T02:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1749v2","created_at":"2026-05-18T02:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1749","created_at":"2026-05-18T02:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"UPMQ7PD7RAKY","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UPMQ7PD7RAKYFSLR","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UPMQ7PD7","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UPMQ7PD7RAKYFSLR5BG5ZTM4RZ","target":"record","payload":{"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"},"canonical_sha256":"a3d90fbc7f881582c971e84ddccd9c8e7c103d4bd0f2810864d51a49981010ee","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"},"source_kind":"arxiv","source_id":"1411.1749","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bviHuUq6r0F/vxLTQaxl1cv51ONrKlHxsx1tFXX81FaQPodRsbs2juwhevrKsMeppNc6OcrswG14bvzuwGluBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:00:13.825784Z"},"content_sha256":"c90e5737be542f5c11201e9114ca6b18c6385662bf19f8b11489a64baa092750","schema_version":"1.0","event_id":"sha256:c90e5737be542f5c11201e9114ca6b18c6385662bf19f8b11489a64baa092750"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UPMQ7PD7RAKYFSLR5BG5ZTM4RZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zS3E+uodn8SqHa1zs0+VdfSDxTxKyW0NJih4+9jBYBdCIZn2t3yUX0LGJQNIFV6iXHePhEi55gWWMJ9ujsdOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:00:13.826132Z"},"content_sha256":"89e23a7fb9a058bc99a6859f40a670d2ee0d18c012ace126adc3dcd53a3aa19e","schema_version":"1.0","event_id":"sha256:89e23a7fb9a058bc99a6859f40a670d2ee0d18c012ace126adc3dcd53a3aa19e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/bundle.json","state_url":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T13:00:13Z","links":{"resolver":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ","bundle":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/bundle.json","state":"https://pith.science/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPMQ7PD7RAKYFSLR5BG5ZTM4RZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UPMQ7PD7RAKYFSLR5BG5ZTM4RZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"87ab3d8fea6e839963f9ca4b182f19a055e52ae3d93e9e3fc22794b6edf4bdc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-06T20:58:35Z","title_canon_sha256":"d4c2bdb280f37a40effc96a6dcbe2bacd8cd90cfa75985f2740836d44348e68b"},"schema_version":"1.0","source":{"id":"1411.1749","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1749","created_at":"2026-05-18T02:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1749v2","created_at":"2026-05-18T02:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1749","created_at":"2026-05-18T02:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"UPMQ7PD7RAKY","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UPMQ7PD7RAKYFSLR","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UPMQ7PD7","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:89e23a7fb9a058bc99a6859f40a670d2ee0d18c012ace126adc3dcd53a3aa19e","target":"graph","created_at":"2026-05-18T02:19:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Gabor Meszaros, Teeradej Kittipassorn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-06T20:58:35Z","title":"Frustrated Triangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1749","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c90e5737be542f5c11201e9114ca6b18c6385662bf19f8b11489a64baa092750","target":"record","created_at":"2026-05-18T02:19:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"87ab3d8fea6e839963f9ca4b182f19a055e52ae3d93e9e3fc22794b6edf4bdc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-06T20:58:35Z","title_canon_sha256":"d4c2bdb280f37a40effc96a6dcbe2bacd8cd90cfa75985f2740836d44348e68b"},"schema_version":"1.0","source":{"id":"1411.1749","kind":"arxiv","version":2}},"canonical_sha256":"a3d90fbc7f881582c971e84ddccd9c8e7c103d4bd0f2810864d51a49981010ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3d90fbc7f881582c971e84ddccd9c8e7c103d4bd0f2810864d51a49981010ee","first_computed_at":"2026-05-18T02:19:16.550619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:16.550619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jgcZ/ppc9rmUhfnagynXFyZMscwkHhMVmY3tSYaU0xgjks2gdjZEQkFq+ur4D4XeVU3hyKZ5O9xGfAq5UIGZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:16.551274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1749","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c90e5737be542f5c11201e9114ca6b18c6385662bf19f8b11489a64baa092750","sha256:89e23a7fb9a058bc99a6859f40a670d2ee0d18c012ace126adc3dcd53a3aa19e"],"state_sha256":"45fb5d1326bbd549c474c2cca10c62189107d79980e3fc06077888fbbc807b05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SkUAcr6d1pMfKy22b5cywM8f6qYyMp/PIPSyGba5TWkT0LwoS+d84ZmcwWR1qZm3xN6rLXc2xzU2jLiO+MGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:00:13.828132Z","bundle_sha256":"8b14a4ee627ab73d34e3df5ab7ddb1de99597a33d5861600fb6a9b464b3c5e8a"}}