{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2LC3OTS3DAAFFNRLFXQUQR7KJG","short_pith_number":"pith:2LC3OTS3","canonical_record":{"source":{"id":"1509.05505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-18T04:49:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4b2d3f920f8ac6f5fcb65036373cdd6258308411eda3404a2539579ca0708164","abstract_canon_sha256":"149613108ab4fa3f481878642bacce4ebb52a544d61288fe2498c0e5212a86b3"},"schema_version":"1.0"},"canonical_sha256":"d2c5b74e5b180052b62b2de14847ea49a6a40453f123c2aaefbd74a86f646501","source":{"kind":"arxiv","id":"1509.05505","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05505","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05505v1","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05505","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"2LC3OTS3DAAF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2LC3OTS3DAAFFNRL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2LC3OTS3","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2LC3OTS3DAAFFNRLFXQUQR7KJG","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-18T04:49:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4b2d3f920f8ac6f5fcb65036373cdd6258308411eda3404a2539579ca0708164","abstract_canon_sha256":"149613108ab4fa3f481878642bacce4ebb52a544d61288fe2498c0e5212a86b3"},"schema_version":"1.0"},"canonical_sha256":"d2c5b74e5b180052b62b2de14847ea49a6a40453f123c2aaefbd74a86f646501","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:43.004199Z","signature_b64":"sZb+Tji6kvEERWPVo+/fxUBqBded8B87ucm7lJshGuNwttVxt8t1W/AGEa1zYiXyU7K7zjoOU5rmnl6msOTrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2c5b74e5b180052b62b2de14847ea49a6a40453f123c2aaefbd74a86f646501","last_reissued_at":"2026-05-18T01:32:43.003684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:43.003684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05505","source_version":1,"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-18T01:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5eSnenby55IPzCBj6iq6ORlPZuTRnSK+MeTZShIUFJ9qyB9mXFgdIBQjjWUKN1aqVxNkU6ahRPHdINBMDRRPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:59:29.382628Z"},"content_sha256":"140d6e5a053c6dde6fe4a4ae9660c46bce17d506c2294d01204ca4d96bc1f1d5","schema_version":"1.0","event_id":"sha256:140d6e5a053c6dde6fe4a4ae9660c46bce17d506c2294d01204ca4d96bc1f1d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2LC3OTS3DAAFFNRLFXQUQR7KJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Small Polygon Compression For Integer Coordinates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhinav Jauhri, Hakan Erdogmus, Martin Griss","submitted_at":"2015-09-18T04:49:55Z","abstract_excerpt":"We describe several polygon compression techniques to enable efficient transmission of polygons representing geographical targets. The main application is to embed compressed polygons to emergency alert messages that have strict length restrictions, as in the case of Wireless Emergency Alert messages. We are able to compress polygons to between 9.7% and 23.6% of original length, depending on characteristics of the specific polygons, reducing original polygon lengths from 43-331 characters to 8-55 characters. The best techniques apply several heuristics to perform initial compression, and then "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05505","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"},"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-18T01:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"os6wjzE+pM35K4o6ZLWNXyoTHN5vu2PrNMuF5TnEXzPew65NDJmvJIdtTQsyzP836k4XtOjc8aBfT741Ud83DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:59:29.382982Z"},"content_sha256":"8446452358d548d1dddc0bb3e5e60e5058c6837b8a5ba6dc5a68d47ed17ec991","schema_version":"1.0","event_id":"sha256:8446452358d548d1dddc0bb3e5e60e5058c6837b8a5ba6dc5a68d47ed17ec991"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LC3OTS3DAAFFNRLFXQUQR7KJG/bundle.json","state_url":"https://pith.science/pith/2LC3OTS3DAAFFNRLFXQUQR7KJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LC3OTS3DAAFFNRLFXQUQR7KJG/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-23T19:59:29Z","links":{"resolver":"https://pith.science/pith/2LC3OTS3DAAFFNRLFXQUQR7KJG","bundle":"https://pith.science/pith/2LC3OTS3DAAFFNRLFXQUQR7KJG/bundle.json","state":"https://pith.science/pith/2LC3OTS3DAAFFNRLFXQUQR7KJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LC3OTS3DAAFFNRLFXQUQR7KJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2LC3OTS3DAAFFNRLFXQUQR7KJG","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":"149613108ab4fa3f481878642bacce4ebb52a544d61288fe2498c0e5212a86b3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-18T04:49:55Z","title_canon_sha256":"4b2d3f920f8ac6f5fcb65036373cdd6258308411eda3404a2539579ca0708164"},"schema_version":"1.0","source":{"id":"1509.05505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05505","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05505v1","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05505","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"2LC3OTS3DAAF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2LC3OTS3DAAFFNRL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2LC3OTS3","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:8446452358d548d1dddc0bb3e5e60e5058c6837b8a5ba6dc5a68d47ed17ec991","target":"graph","created_at":"2026-05-18T01:32:43Z","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":"We describe several polygon compression techniques to enable efficient transmission of polygons representing geographical targets. The main application is to embed compressed polygons to emergency alert messages that have strict length restrictions, as in the case of Wireless Emergency Alert messages. We are able to compress polygons to between 9.7% and 23.6% of original length, depending on characteristics of the specific polygons, reducing original polygon lengths from 43-331 characters to 8-55 characters. The best techniques apply several heuristics to perform initial compression, and then ","authors_text":"Abhinav Jauhri, Hakan Erdogmus, Martin Griss","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-18T04:49:55Z","title":"Small Polygon Compression For Integer Coordinates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05505","kind":"arxiv","version":1},"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:140d6e5a053c6dde6fe4a4ae9660c46bce17d506c2294d01204ca4d96bc1f1d5","target":"record","created_at":"2026-05-18T01:32:43Z","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":"149613108ab4fa3f481878642bacce4ebb52a544d61288fe2498c0e5212a86b3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-18T04:49:55Z","title_canon_sha256":"4b2d3f920f8ac6f5fcb65036373cdd6258308411eda3404a2539579ca0708164"},"schema_version":"1.0","source":{"id":"1509.05505","kind":"arxiv","version":1}},"canonical_sha256":"d2c5b74e5b180052b62b2de14847ea49a6a40453f123c2aaefbd74a86f646501","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2c5b74e5b180052b62b2de14847ea49a6a40453f123c2aaefbd74a86f646501","first_computed_at":"2026-05-18T01:32:43.003684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:43.003684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sZb+Tji6kvEERWPVo+/fxUBqBded8B87ucm7lJshGuNwttVxt8t1W/AGEa1zYiXyU7K7zjoOU5rmnl6msOTrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:43.004199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:140d6e5a053c6dde6fe4a4ae9660c46bce17d506c2294d01204ca4d96bc1f1d5","sha256:8446452358d548d1dddc0bb3e5e60e5058c6837b8a5ba6dc5a68d47ed17ec991"],"state_sha256":"97b40c2fdf0f299d0e9d4a3225dcc02ebe76899cf513a95dffa50c543e855eab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gy/hvhImAHo79bSaqgHZTGCceDqatdHhuNcYiUe31kQ5jUizEYPo7Z8VtP18FUnQNqZF52aChEBEZlI00cX2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:59:29.385022Z","bundle_sha256":"7c90909e2b1c588aa445dea8139cc9d5dc92feea7f1b4d2b230a7a818118cfb2"}}